Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover.

Daniel Mölle Stefan Richter Peter Rossmanith

Published in: CSR (2006)

Keyphrases

vertex cover
learning algorithm
computational complexity
approximation algorithms
special case
optimization problems
upper bound
worst case
combinatorial optimization
error bounds
randomized algorithm