DMCA
Approximate Max-Flow Min-Cut Theorems (Course Notes Extension for COMP5703) (2014)
by
Shanshan Wang
BibTeX
@MISC{Wang14approximatemax-flow,
author = {Shanshan Wang},
title = {Approximate Max-Flow Min-Cut Theorems (Course Notes Extension for COMP5703)},
year = {2014}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this report, we discuss two approximate max-flow min-cut theorems that first intro-duced by Tom Leighton and Satish Rao in 1988 [9] and extended in 1999 [10] for uniform multicommodity flow problems. In the theorems they first showed that for any n-node multicommodity flow problem with uniform demands, the max-flow is a Ω(log n) factor
