Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard.
Man-Kwun ChiuJonas CleveMartin NöllenburgPublished in: CoRR (2020)
Keyphrases
- np hard
- special case
- approximation algorithms
- scheduling problem
- np complete
- optimal solution
- minimum cost
- worst case
- data sets
- embedded systems
- linear programming
- lower bound
- database
- expert systems
- multiple representations
- set cover
- neural network
- branch and bound algorithm
- real world
- remains np hard
- evolutionary algorithm
- computationally challenging
- recognizing objects
- decision problems
- constraint satisfaction problems
- machine learning
- higher level
- artificial intelligence
- reinforcement learning
- computational complexity