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

Daniel Mölle Stefan Richter Peter Rossmanith

Published in: Theory Comput. Syst. (2008)

Keyphrases

vertex cover
learning algorithm
bayesian networks
computational complexity
optimization problems
theoretical analysis
combinatorial optimization
approximation algorithms
minimum spanning tree
precedence constraints