Odd minimum cut sets and b-matchings revisited
Abstract
The famous Padberg-Rao separation algorithm for b-matching polyhedra can be implemented to run in O(n2m log(n2/m)) time in the uncapacitated case, and in O(nm2 log(n2/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(n2m log(n2/m)) time.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.