Login / Signup
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography.
Christoph Dürr
Flavio Guiñez
Martín Matamala
Published in:
SIAM J. Discret. Math. (2012)
Keyphrases
</>
discrete tomography
discrete sets
np hardness
np hard
horizontal and vertical projections
optimal solution
binary matrices
convex sets
integer programming
worst case
special case
approximation algorithms
tomographic reconstruction
mixed integer
cutting plane
linear programming
dynamic programming
lower bound