Single Commodity Flow Algorithms for Lifts of Graphic and Cographic Matroids
| dc.contributor.author | Stuive, Leanne | |
| dc.date.accessioned | 2013-01-23T14:38:58Z | |
| dc.date.available | 2013-01-23T14:38:58Z | |
| dc.date.issued | 2013-01-23T14:38:58Z | |
| dc.date.submitted | 2013 | |
| dc.description.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. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/7225 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.subject | discrete optimization | en |
| dc.subject | matroid flows | en |
| dc.subject.program | Combinatorics and Optimization | en |
| dc.title | Single Commodity Flow Algorithms for Lifts of Graphic and Cographic Matroids | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |