Lancaster EPrints

Odd minimum cut-sets and b-matchings revisited

Letchford, A N and Reinelt, G and Theis, D O (2008) Odd minimum cut-sets and b-matchings revisited. SIAM Journal of Discrete Mathematics, 22 (4). pp. 1480-1487. ISSN 0895-4801

Full text not available from this repository.

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.

Item Type: Article
Journal or Publication Title: SIAM Journal of Discrete Mathematics
Uncontrolled Keywords: matching ; polyhedra ; separation
Subjects: H Social Sciences > HB Economic Theory
Departments: Lancaster University Management School > Management Science
ID Code: 44377
Deposited By: ep_importer_pure
Deposited On: 11 Jul 2011 19:14
Refereed?: Yes
Published?: Published
Last Modified: 09 Apr 2014 22:24
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/44377

Actions (login required)

View Item