Login / Signup

Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs.

Zuosong LiangErfang Shan
Published in: Inf. Process. Lett. (2011)
Keyphrases
  • approximation algorithms
  • special case
  • np hard
  • scheduling problem
  • undirected graph
  • randomized algorithms
  • dynamic programming
  • linear program
  • minimum cost
  • primal dual
  • set cover
  • maximum weight