Home > Research > Publications & Outputs > Odd minimum cut-sets and b-matchings revisited
View graph of relations

Odd minimum cut-sets and b-matchings revisited

Research output: Contribution to journalJournal article

Published
Close
<mark>Journal publication date</mark>2008
<mark>Journal</mark>SIAM Journal on Discrete Mathematics
Issue number4
Volume22
Number of pages8
Pages (from-to)1480-1487
<mark>State</mark>Published
<mark>Original language</mark>English

Abstract

The famous Padberg–Rao separation algorithm for b-matching polyhedra can be implemented to run in O(|V|^2|E| log(|V|^2/|E|)) time in the uncapacitated case, and in O(|V||E|^2 log(|V|^2/|E|)) time in the capacitated case. We give a new and simple algorithm for the capacitated case which can be implemented to run in O(|V|^2|E|\log(|V|^2/|E|)) time.