Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere.
Xuehou TanGangshan WuPublished in: FAW-AAIM (2011)
Keyphrases
- approximation algorithms
- convex hull
- strictly convex
- np hard
- special case
- quadratic program
- vertex cover
- minimum cost
- primal dual
- worst case
- network design problem
- randomized algorithms
- np hardness
- approximation ratio
- exact algorithms
- set cover
- convex optimization
- facility location problem
- precedence constraints
- convex sets
- mixed integer
- convex functions
- constant factor
- polynomial time approximation
- open shop
- combinatorial auctions
- approximation schemes
- disjoint paths
- computational complexity
- convex relaxation
- single machine