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.
 

Combinatorial Algorithms for Submodular Function Minimization and Related Problems

Thumbnail Image

Files

Christopher_Price.pdf (456.96 KB)

Date

2015-05-19

Authors

Price, Christopher

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

Submodular 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.

Description

Keywords

algorithms, combinatorial optimization, submodular function minimization

LC Keywords

Citation

URI

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

Collections

Theses
Combinatorics and Optimization