Tile Packing Tomography is NP-hard

Details Tile Packing Tomography is NP-hard Tile Packing Tomography is NP-hard

2009-11-13

arxiv.org/abs/0911.2567v2

Computer Science

Computational Complexity

Scientific paper

Discrete tomography deals with reconstructing finite spatial objects from lower dimensional projections and has applications for example in timetable design. In this paper we consider the problem of reconstructing a tile packing from its row and column projections. It consists of disjoint copies of a fixed tile, all contained in some rectangular grid. The projections tell how many cells are covered by a tile in each row and column. How difficult is it to construct a tile packing satisfying given projections? It was known to be solvable by a greedy algorithm for bars (tiles of width or height 1), and NP-hardness results were known for some specific tiles. This paper shows that the problem is NP-hard whenever the tile is not a bar.

Affiliated with

Also associated with

No associations

Rating

Tile Packing Tomography is NP-hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tile Packing Tomography is NP-hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tile Packing Tomography is NP-hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-149427