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.
 

On Vegh's Strongly Polynomial Algorithm for Generalized Flows

Thumbnail Image

Files

Lo_VenusHiuLing.pdf (645.04 KB)

Date

2014-05-22

Authors

Lo, Venus Hiu Ling

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

This thesis contains an exposition of the new strongly polynomial algorithm for the generalized flow problem by Laszlo Vegh (2013). It has been a long-standing open question whether such an algorithm exists, until it was resolved by Vegh in 2013. Generalized flows have many applications in economic problems, such as transportation of goods and foreign currency exchange. The main presentation follows Vegh's paper, but this exposition contains some simplifications and differences in the algorithm and its analysis. The main difference is that we consider the running time of the strongly polynomial algorithm up to one arc contraction before starting fresh on a smaller network. This increases the running time of the algorithm slightly, but the analysis becomes easier.

Description

Keywords

generalized flows, flows, network flow, strongly polynomial

LC Keywords

Citation

URI

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

Collections

Theses
Combinatorics and Optimization