Login / Signup

Maintaining a large matching and a small vertex cover.

Krzysztof OnakRonitt Rubinfeld
Published in: STOC (2010)
Keyphrases
  • vertex cover
  • brute force search
  • approximation algorithms
  • partial order
  • precedence constraints
  • polynomial time approximation