Simply Realising an Imprecise Polyline is NP-hard.
Thijs van der HorstTim OpheldersBart van der SteenhovenPublished in: CoRR (2023)
Keyphrases
- np hard
- approximation algorithms
- optimal solution
- special case
- np complete
- lower bound
- scheduling problem
- closely related
- worst case
- np hardness
- linear programming
- minimum cost
- integer programming
- remains np hard
- database
- greedy heuristic
- knapsack problem
- constraint satisfaction problems
- computer vision
- branch and bound algorithm
- decision problems
- uncertain information
- set cover
- approximation ratio
- data sets