Improved approximation algorithms for rectangle tiling and packing.
Piotr BermanBhaskar DasGuptaS. MuthukrishnanSuneeta RamaswamiPublished in: SODA (2001)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- minimum cost
- worst case
- approximation ratio
- set cover
- network design problem
- facility location problem
- maximum profit
- randomized algorithms
- exact algorithms
- undirected graph
- constant factor
- constant factor approximation
- disjoint paths
- open shop
- scheduling problem
- approximation schemes
- strongly np hard
- combinatorial auctions
- np hardness
- polynomial time approximation
- upper bound
- linear programming
- lower bound
- precedence constraints
- primal dual