A Primal-Dual Approximation Algorithm for the Concurrent Flow Problem
The multicommodity flow problem involves shipping multiple commodities simultaneously through a network so that the total flow over each edge does not exceed the capacity of that edge. The concurrent flow problem also associates with each commodity a demand, and involves finding the maximum fraction...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
Digital WPI
2010
|
| Subjects: | |
| Online Access: | https://digitalcommons.wpi.edu/etd-theses/474 https://digitalcommons.wpi.edu/cgi/viewcontent.cgi?article=1473&context=etd-theses |