Single-source k-splittable min-cost flows

被引：8
|
作者：
Salazar, Fernanda [2 ]
Skutella, Martin [1 ]
机构：
[1] Tech Univ Berlin, Inst Math, D-10623 Berlin, Germany
[2] Escuela Politec Nacl, Dept Matemat, Quito, Ecuador
来源：
OPERATIONS RESEARCH LETTERS | 2009年 / 37卷 / 02期
关键词：
Approximation algorithm; Multi-commodity flow; Network flow; Routing; Unsplittable now; k-splittable flow; SOURCE UNSPLITTABLE FLOW;
D O I：
10.1016/j.orl.2008.12.004
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
Motivated by a famous open question on the single-source unsplittable minimum cost flow problem, we present a new approximation result for the relaxation of the problem where, for a given number k, each commodity must be routed along at most k paths. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：71 / 74
页数：4
相关论文
共 36 条
  • [1] Complexity and approximability of k-splittable flows
    Koch, Ronald
    Spenke, Ines
    THEORETICAL COMPUTER SCIENCE, 2006, 369 (1-3) : 338 - 347
  • [2] On the approximation of the single source k-splittable flow problem
    Caramia, Massimiliano
    Sgalambro, Antonino
    JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (02) : 277 - 289
  • [3] Approximation and complexity of k-splittable flows
    Koch, R
    Skutella, M
    Spenke, I
    APPROXIMATION AND ONLINE ALGORITHMS, 2006, 3879 : 244 - 257
  • [4] NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
    Erlebach, T
    Hall, A
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 194 - 202
  • [5] NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
    Erlebach, T
    Hall, A
    JOURNAL OF SCHEDULING, 2004, 7 (03) : 223 - 241
  • [6] Maximum k-Splittable s,t-Flows
    Ronald Koch
    Martin Skutella
    Ines Spenke
    Theory of Computing Systems, 2008, 43 : 56 - 66
  • [7] NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow
    Thomas Erlebach
    Alexander Hall
    Journal of Scheduling, 2004, 7 : 223 - 241
  • [8] Approximating the single source unsplittable min-cost flow problem
    Martin Skutella
    Mathematical Programming, 2002, 91 : 493 - 514
  • [9] Approximating the single source unsplittable min-cost flow problem
    Skutella, M
    MATHEMATICAL PROGRAMMING, 2002, 91 (03) : 493 - 514
  • [10] Approximating the single source unsplittable min-cost flow problem
    Skutella, M
    41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, : 136 - 145
1234