Login / Signup

Efficient Algorithms for the max k -vertex cover Problem.

Federico Della CroceVangelis Th. Paschos
Published in: IFIP TCS (2012)
Keyphrases
  • vertex cover
  • approximation algorithms
  • partial order
  • precedence constraints
  • planar graphs
  • log likelihood
  • polynomial time approximation
  • optimality criterion
  • special case
  • partially ordered