Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon.
Hee-Kap AhnPeter BraßOtfried CheongHyeon-Suk NaChan-Su ShinAntoine VigneronPublished in: COCOON (2004)
Keyphrases
- approximation algorithms
- convex hull
- minkowski sum
- np hard
- special case
- vertex cover
- set cover
- worst case
- minimum cost
- facility location problem
- exact algorithms
- np hardness
- primal dual
- approximation ratio
- constant factor
- randomized algorithms
- open shop
- network design problem
- learning algorithm
- quadratic program
- approximation schemes
- disjoint paths
- constant factor approximation
- convex optimization
- polynomial time approximation
- greedy algorithm