Faster and simpler algorithms for multicommodity flow and other fractional packing problems

被引：166
|
作者：
Garg, Naveen [1 ]
Koenemann, Jochen
机构：
[1] Indian Inst Technol, New Delhi, India
[2] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
来源：
SIAM JOURNAL ON COMPUTING | 2007年 / 37卷 / 02期
关键词：
multicommodity flow; fractional packing; concurrent flow; approximation algorithms;
D O I：
10.1137/S0097539704446232
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We present new, faster, and much simpler algorithms for these problems.
引用
收藏
页码：630 / 652
页数：23
相关论文
共 50 条
  • [1] Faster and simpler algorithms for multicommodity flow and other fractional packing problems
    Garg, N
    Könemann, J
    [J]. 39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 300 - 309
  • [2] Faster Approximation Schemes for Fractional Multicommodity Flow Problems
    Karakostas, George
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2008, 4 (01)
  • [3] Faster approximation schemes for fractional multicommodity flow problems
    Karakostas, G
    [J]. PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 166 - 173
  • [4] Faster Approximation Schemes for Fractional Multicommodity Flow Problems via Dynamic Graph Algorithms
    Madry, Aleksander
    [J]. STOC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2010, : 121 - 130
  • [5] Faster and simpler approximation algorithms for mixed packing and covering problems
    Diedrich, Florian
    Jansen, Klaus
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 377 (1-3) : 181 - 204
  • [6] Algorithms for multiplayer multicommodity flow problems
    Attila Bernáth
    Tamás Király
    Erika Renáta Kovács
    Gergely Mádi-Nagy
    Gyula Pap
    Júlia Pap
    Jácint Szabó
    László Végh
    [J]. Central European Journal of Operations Research, 2013, 21 : 699 - 712
  • [7] Algorithms for multiplayer multicommodity flow problems
    Bernath, Attila
    Kiraly, Tamas
    Kovacs, Erika Renata
    Madi-Nagy, Gergely
    Pap, Gyula
    Pap, Julia
    Szabo, Jacint
    Vegh, Laszlo
    [J]. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2013, 21 (04) : 699 - 712
  • [8] Faster algebraic algorithms for path and packing problems
    Koutis, Ioannis
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, PROCEEDINGS, 2008, 5125 : 575 - 586
  • [9] A survey of algorithms for convex multicommodity flow problems
    Ouorou, A
    Mahey, P
    Vial, JP
    [J]. MANAGEMENT SCIENCE, 2000, 46 (01) : 126 - 147
  • [10] FAST APPROXIMATION ALGORITHMS FOR MULTICOMMODITY FLOW PROBLEMS
    LEIGHTON, T
    MAKEDON, F
    PLOTKIN, S
    STEIN, C
    TARDOS, E
    TRAGOUDAS, S
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 50 (02) : 228 - 243
12345