<--- Back to Details
First PageDocument Content
Operations research / Linear programming / Routing / Flow network / Approximate max-flow min-cut theorem / Shortest path problem
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

Similar Documents