Login / Signup
Approximation Algorithms for Union and Intersection Covering Problems.
Marek Cygan
Fabrizio Grandoni
Stefano Leonardi
Marcin Mucha
Marcin Pilipczuk
Piotr Sankowski
Published in:
FSTTCS (2011)
Keyphrases
</>
approximation algorithms
vertex cover
np hard
np hardness
special case
exact algorithms
approximation schemes
worst case
network design problem
randomized algorithms
np complete
minimum cost
mathematical programming
open shop
learning algorithm
optimization problems