Tile Packing Tomography is NP-hard
Marek ChrobakChristoph DürrFlavio GuiñezAntoni LozanoKim Thang NguyenPublished in: CoRR (2009)
Keyphrases
- np hard
- image reconstruction
- optimal solution
- scheduling problem
- np complete
- special case
- minimum cost
- lower bound
- np hardness
- approximation algorithms
- integer programming
- packing problem
- linear programming
- computational complexity
- tomographic reconstruction
- closely related
- branch and bound algorithm
- decision problems
- limited angle
- greedy heuristic
- worst case
- polynomial time approximation
- discrete tomography
- computationally challenging
- maximum profit
- data sets
- approximation ratio
- constraint satisfaction problems
- objective function
- high quality
- machine learning