Tile-Packing Tomography Is NP-hard.
Marek ChrobakChristoph DürrFlavio GuiñezAntoni LozanoKim Thang NguyenPublished in: Algorithmica (2012)
Keyphrases
- np hard
- image reconstruction
- approximation algorithms
- integer programming
- lower bound
- special case
- packing problem
- np complete
- worst case
- optimal solution
- linear programming
- scheduling problem
- remains np hard
- decision problems
- np hardness
- tomographic reconstruction
- greedy heuristic
- knapsack problem
- closely related
- branch and bound algorithm
- minimum cost
- computationally challenging
- limited angle
- constraint satisfaction problems
- super resolution
- medical images
- computational complexity
- high quality
- real time
- dynamic programming
- lagrangian relaxation
- search algorithm
- artificial intelligence
- machine learning
- strip packing
- data sets