Mostra el registre d'ítem simple
Tile-packing tomography is NP-hard
dc.contributor.author | Chrobak, Marek |
dc.contributor.author | Dürr, Christoph |
dc.contributor.author | Guíñez, Flavio |
dc.contributor.author | Lozano Boixadors, Antoni |
dc.contributor.author | Kim Thang, Nguyen |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
dc.date.accessioned | 2012-06-21T09:53:08Z |
dc.date.created | 2010 |
dc.date.issued | 2010 |
dc.identifier.citation | Chrobak, M. [et al.]. Tile-packing tomography is NP-hard. A: International Computing and Combinatorics Conference. "Computing and Combinatorics: 16th Annual International Conference, COCOON 2010: Nha Trang, Vietnam, July 19-21, 2010: Proceedings". Nha Trang: 2010, p. 254-263. |
dc.identifier.uri | http://hdl.handle.net/2117/16114 |
dc.description.abstract | Discrete tomography deals with reconstructing finite spatial objects from their projections. The objects we study in this paper are called tilings or tile-packings, and they consist of a number of disjoint copies of a fixed tile, where a tile is defined as a connected set of grid points. A row projection specifies how many grid points are covered by tiles in a given row; column projections are defined analogously. For a fixed tile, is it possible to reconstruct its tilings from their projections in polynomial time? It is known that the answer to this question is affirmative if the tile is a bar (its width or height is 1), while for some other types of tiles NP-hardness results have been shown in the literature. In this paper we present a complete solution to this question by showing that the problem remains NP-hard for all tiles other than bars. |
dc.format.extent | 10 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
dc.subject.lcsh | Computational complexity |
dc.subject.lcsh | Tomography |
dc.title | Tile-packing tomography is NP-hard |
dc.type | Conference report |
dc.subject.lemac | Complexitat computacional |
dc.subject.lemac | Tomografia |
dc.contributor.group | Universitat Politècnica de Catalunya. LOGPROG - Lògica i Programació |
dc.identifier.doi | 10.1007/978-3-642-14031-0_29 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://www.springerlink.com/content/g17gp31206h43x1m/ |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 5292414 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Chrobak, M.; Dürr, C.; Guíñez, F.; Lozano, A.; Kim Thang, N. |
local.citation.contributor | International Computing and Combinatorics Conference |
local.citation.pubplace | Nha Trang |
local.citation.publicationName | Computing and Combinatorics: 16th Annual International Conference, COCOON 2010: Nha Trang, Vietnam, July 19-21, 2010: Proceedings |
local.citation.startingPage | 254 |
local.citation.endingPage | 263 |