Sign in
Improved Approximation Algorithms for Balanced Partitioning Problems.
Harald Räcke
Richard Stotz
Published in:
STACS (2016)
Keyphrases
</>
approximation algorithms
vertex cover
np hardness
exact algorithms
randomized algorithms
np hard
special case
worst case
approximation schemes
network design problem
open shop
lower bound
polynomial time approximation
primal dual
minimum cost
theoretical analysis
np complete
optimization problems