New Approximation Algorithms for Minimum Enclosing Convex Shapes.
Ankan SahaS. V. N. VishwanathanXinhua ZhangPublished in: SODA (2011)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- convex hull
- np hard
- special case
- worst case
- quadratic program
- vertex cover
- facility location problem
- minkowski sum
- spanning tree
- convex optimization
- randomized algorithms
- approximation schemes
- open shop
- undirected graph
- network design problem
- set cover
- approximation ratio
- primal dual
- precedence constraints
- integer programming
- polynomial time approximation
- partial order
- disjoint paths
- error bounds