Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms.
Olivier BeaumontVincent BoudetFabrice RastelloYves RobertPublished in: Algorithmica (2002)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- open shop
- facility location problem
- minimum cost
- primal dual
- set cover
- approximation schemes
- network design problem
- np hardness
- constant factor
- randomized algorithms
- approximation ratio
- packing problem
- exact algorithms
- integer programming
- scheduling problem
- constant factor approximation