Sign in

Approximately: Independence Implies Vertex Cover.

Sariel Har-Peled
Published in: CoRR (2023)
Keyphrases
  • vertex cover
  • approximation algorithms
  • planar graphs
  • precedence constraints
  • partial order
  • polynomial time approximation
  • np hard
  • optimality criterion
  • scheduling problem
  • bayesian networks
  • worst case