Show simple item record

dc.contributor.authorStuive, Leanne
dc.date.accessioned2013-01-23 14:38:58 (GMT)
dc.date.available2013-01-23 14:38:58 (GMT)
dc.date.issued2013-01-23T14:38:58Z
dc.date.submitted2013
dc.identifier.urihttp://hdl.handle.net/10012/7225
dc.description.abstractConsider 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.en
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectdiscrete optimizationen
dc.subjectmatroid flowsen
dc.titleSingle Commodity Flow Algorithms for Lifts of Graphic and Cographic Matroidsen
dc.typeMaster Thesisen
dc.pendingfalseen
dc.subject.programCombinatorics and Optimizationen
uws-etd.degree.departmentCombinatorics and Optimizationen
uws-etd.degreeMaster of Mathematicsen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages