Approximation algorithms for cutting a convex polyhedron out of a sphere.
Xuehou TanGangshan WuPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- approximation algorithms
- convex hull
- strictly convex
- np hard
- quadratic program
- special case
- vertex cover
- facility location problem
- minimum cost
- worst case
- network design problem
- primal dual
- open shop
- approximation schemes
- constant factor
- set cover
- constant factor approximation
- precedence constraints
- approximation ratio
- undirected graph
- convex optimization
- np hardness
- convex sets
- randomized algorithms
- feasible solution
- objective function
- polynomial time approximation
- lower bound
- search algorithm