Rigid foldability is NP-hard.
Hugo Alves AkitayaErik D. DemaineTakashi HoriyamaThomas C. HullJason S. KuTomohiro TachiPublished in: J. Comput. Geom. (2020)
Keyphrases
- np hard
- optimal solution
- special case
- scheduling problem
- approximation algorithms
- closely related
- linear programming
- worst case
- np complete
- three dimensional
- np hardness
- lower bound
- decision problems
- greedy heuristic
- knapsack problem
- integer programming
- branch and bound algorithm
- computational complexity
- remains np hard
- artificial neural networks
- expert systems
- image segmentation
- set cover