Approximation Algorithms for Covering Polygons with Squares and Similar Problems.
Christos LevcopoulosJoachim GudmundssonPublished in: RANDOM (1997)
Keyphrases
- approximation algorithms
- similar problems
- np hard
- special case
- vertex cover
- minimum cost
- facility location problem
- worst case
- randomized algorithms
- open shop
- approximation ratio
- network design problem
- approximation schemes
- set cover
- precedence constraints
- primal dual
- exact algorithms
- constant factor
- undirected graph
- convex hull
- np hardness
- word problems
- combinatorial auctions
- objective function
- strongly np hard
- search algorithm