Improved Approximation Algorithms for Box Contact Representations.
Michael A. BekosThomas C. van DijkMartin FinkPhilipp KindermannStephen G. KobourovSergey PupyrevJoachim SpoerhaseAlexander WolffPublished in: ESA (2014)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- approximation ratio
- facility location problem
- network design problem
- np hardness
- open shop
- set cover
- constant factor
- randomized algorithms
- primal dual
- linear programming
- precedence constraints
- exact algorithms
- polynomial time approximation
- approximation schemes
- disjoint paths