Near-Linear Time Approximation Algorithms for Curve Simplification.
Pankaj K. AgarwalSariel Har-PeledNabil H. MustafaYusu WangPublished in: Algorithmica (2005)
Keyphrases
- approximation algorithms
- worst case
- np hard
- facility location problem
- special case
- vertex cover
- minimum cost
- primal dual
- minimum length
- approximation ratio
- network design problem
- lower bound
- set cover
- np hardness
- open shop
- disjoint paths
- digital curves
- exact algorithms
- greedy algorithm
- error bounds
- undirected graph
- endpoints
- constant factor
- approximation schemes
- linear programming
- upper bound
- precedence constraints
- combinatorial auctions
- polynomial time approximation
- genetic algorithm