Show simple item record

dc.contributor.authorPrice, Christopher
dc.date.accessioned2015-05-19 13:54:35 (GMT)
dc.date.available2015-05-19 13:54:35 (GMT)
dc.date.issued2015-05-19
dc.date.submitted2015
dc.identifier.urihttp://hdl.handle.net/10012/9356
dc.description.abstractSubmodular functions are common in combinatorics; examples include the cut capacity function of a graph and the rank function of a matroid. The submodular function minimization problem generalizes the classical minimum cut problem and also contains a number of other combinatorial optimization problems as special cases. In this thesis, we study submodular function minimization and two related problems: matroid polyhedron membership and matroid intersection. A significant contribution concerns algorithms for the latter problems due to Cunningham. In particular, we identify and correct errors in the original proofs of the running time bounds for these algorithms.en
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectalgorithmsen
dc.subjectcombinatorial optimizationen
dc.subjectsubmodular function minimizationen
dc.titleCombinatorial Algorithms for Submodular Function Minimization and Related Problemsen
dc.typeMaster Thesisen
dc.pendingfalse
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