Login / Signup
Improved Approximation Algorithms for Box Contact Representations.
Michael A. Bekos
Thomas C. van Dijk
Martin Fink
Philipp Kindermann
Stephen G. Kobourov
Sergey Pupyrev
Joachim Spoerhase
Alexander Wolff
Published in:
CoRR (2014)
Keyphrases
</>
approximation algorithms
np hard
special case
minimum cost
vertex cover
primal dual
worst case
randomized algorithms
set cover
facility location problem
open shop
constant factor
approximation ratio
disjoint paths
np hardness
network design problem
precedence constraints
exact algorithms
undirected graph