Parameterized and approximation algorithms for finding two disjoint matchings.

Zhi-Zhong Chen Ying Fan Lusheng Wang

Published in: Theor. Comput. Sci. (2014)

Keyphrases

approximation algorithms
np hard
special case
worst case
vertex cover
network design problem
minimum cost
open shop
facility location problem
set cover
exact algorithms
primal dual
randomized algorithms
np hardness
approximation schemes
approximation ratio
disjoint paths