Odd minimum cut sets and b-matchings revisited
Optimization and Control
2011-12-08 v1 Discrete Mathematics
Abstract
The famous Padberg-Rao separation algorithm for b-matching polyhedra can be implemented to run in O(n^2m log(n^2/m)) time in the uncapacitated case, and in O(nm^2 log(n^2/m)) time in the capacitated case (where n is the number of vertices and m is the number of edges of the underlying graph). We give a new and simple algorithm for the capacitated case which can be implemented to run in O(n^2m log(n^2/m)) time.
Keywords
Cite
@article{arxiv.math/0607088,
title = {Odd minimum cut sets and b-matchings revisited},
author = {Adam N. Letchford and Dirk Oliver Theis},
journal= {arXiv preprint arXiv:math/0607088},
year = {2011}
}
Comments
6 pages. An extended abstract of an earlier version appeared in Proc. IPCO X (2004)