7 search results - page 1 / 2 » Faster approximation schemes for fractional multicommodity f... |
STOC
2010
ACM
13 years 9 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
TALG
2008
13 years 4 months ago
2008
SIAMDM
2000
13 years 4 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
CN
2006
13 years 5 months ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...