Stretchability of Pseudolines is NP-Hard.
Peter W. ShorPublished in: Applied Geometry And Discrete Mathematics (1990)
Keyphrases
- np hard
- special case
- scheduling problem
- approximation algorithms
- optimal solution
- lower bound
- closely related
- linear programming
- knapsack problem
- worst case
- np complete
- decision problems
- integer programming
- np hardness
- greedy heuristic
- computational complexity
- branch and bound algorithm
- minimum cost
- remains np hard
- data mining
- partial order
- trade off
- approximate solutions
- artificial neural networks
- computationally hard
- neural network