Single-Source Stochastic Routing Shuchi Chawla1? and Tim Roughgarden2?? 1 2

First Page		Document Content
Date: 2006-07-01 03:46:20 Operations research Linear programming Routing Flow network Approximate max-flow min-cut theorem Shortest path problem		Single-Source Stochastic Routing Shuchi Chawla1? and Tim Roughgarden2?? 1 2 Add to Reading List Source URL: theory.stanford.edu Download Document from Source Website File Size: 156,15 KB Share Document on Facebook

	Single Source Multiroute Flows and Cuts on Uniform Capacity Networks∗ Henning Bruhn† ˇ y‡ Jakub Cern´ DocID: 1qtlI - View Document
	Single-Source Stochastic Routing Shuchi Chawla1? and Tim Roughgarden2?? 1 2 DocID: 1oB7H - View Document
	On Consistent Migration of Flows in SDNs Sebastian Brandt Klaus-Tycho Foerster∗ Roger Wattenhofer DocID: 1o0ZH - View Document
	An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations Jonathan A. Kelner DocID: 4AHr - View Document