Near-Linear Time Approximation Algorithms for Curve Simplification.
Pankaj K. AgarwalSariel Har-PeledNabil H. MustafaYusu WangPublished in: ESA (2002)
Keyphrases
- approximation algorithms
- worst case
- np hard
- special case
- vertex cover
- minimum cost
- minimum length
- facility location problem
- upper bound
- open shop
- primal dual
- exact algorithms
- randomized algorithms
- network design problem
- lower bound
- set cover
- constant factor
- approximation schemes
- greedy algorithm
- endpoints
- approximation ratio
- undirected graph
- knapsack problem
- constant factor approximation