Improved Approximation Algorithms for Box Contact Representations.
Michael A. BekosThomas C. van DijkMartin FinkPhilipp KindermannStephen G. KobourovSergey PupyrevJoachim SpoerhaseAlexander WolffPublished in: Algorithmica (2017)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- facility location problem
- primal dual
- open shop
- np hardness
- approximation schemes
- randomized algorithms
- approximation ratio
- network design problem
- set cover
- constant factor
- genetic algorithm
- precedence constraints
- exact algorithms
- undirected graph
- combinatorial auctions
- constant factor approximation