Approximation algorithms on k-cycle covering and k-clique covering.

Zhongzheng Tang Zhuo Diao

Published in: CoRR (2018)

Keyphrases

approximation algorithms
np hard
special case
vertex cover
minimum cost
set cover
randomized algorithms
worst case
primal dual
network design problem
branch and bound algorithm
open shop
lower bound