UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Single Commodity Flow Algorithms for Lifts of Graphic and Cographic Matroids

Thumbnail Image

Files

Stuive_Leanne.pdf (731.56 KB)

Date

2013-01-23T14:38:58Z

Authors

Stuive, Leanne

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

Consider a binary matroid M given by its matrix representation. We show that if M is a lift of a graphic or a cographic matroid, then in polynomial time we can either solve the single commodity flow problem for M or find an obstruction for which the Max-Flow Min-Cut relation does not hold. The key tool is an algorithmic version of Lehman's Theorem for the set covering polyhedron.

Description

Keywords

discrete optimization, matroid flows

LC Keywords

Citation

URI

http://hdl.handle.net/10012/7225

Collections

Theses
Combinatorics and Optimization