Approximation Algorithms and Hardness Results for Labeled Connectivity Problems.

Refael Hassin Jérôme Monnot Danny Segev

Published in: MFCS (2006)

Keyphrases

approximation algorithms
np hardness
np hard
vertex cover
worst case
randomized algorithms
np complete
exact algorithms
special case
approximation schemes
optimization problems
open shop
precedence constraints
network design problem
minimum cost
practical problems
polynomial time approximation
training data