Approximation Algorithms for Cutting Out Polygons with Lines and Rays.
Xuehou TanPublished in: COCOON (2005)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- network design problem
- approximation ratio
- open shop
- exact algorithms
- set cover
- approximation schemes
- disjoint paths
- convex hull
- np hardness
- facility location problem
- combinatorial auctions
- undirected graph
- constant factor
- precedence constraints
- polynomial time approximation
- upper bound
- constant factor approximation