Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets.
Hee-Kap AhnPeter BraßOtfried CheongHyeon-Suk NaChan-Su ShinAntoine VigneronPublished in: Comput. Geom. (2006)
Keyphrases
- approximation algorithms
- convex sets
- convex hull
- np hard
- finite number
- special case
- variational inequalities
- vertex cover
- worst case
- primal dual
- convex optimization
- set cover
- minimum cost
- convex functions
- np hardness
- disjoint paths
- higher dimensional
- approximation ratio
- semidefinite
- randomized algorithms
- open shop
- constant factor approximation
- approximation guarantees
- scheduling problem
- greedy algorithm