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 条
  • [21] On single-source capacitated facility location with cost and fairness objectives
    Filippi, C.
    Guastaroba, G.
    Speranza, M. G.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 289 (03) : 959 - 974
  • [22] A Single-source Weber Problem with Continuous Piecewise Fixed Cost
    Iriarte, Gabriela
    Escalona, Pablo
    Angulo, Alejandro
    Stegmaier, Raul
    PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS (ICORES), 2017, : 337 - 344
  • [23] HitSim: An Efficient Algorithm for Single-Source and Top-k SimRank Computation
    Bai, Jing
    Zhou, Junfeng
    Chen, Shuotong
    Du, Ming
    Chen, Ziyang
    Min, Mengtao
    INFORMATION, 2024, 15 (06)
  • [24] ProbeSim: Scalable Single-Source and Top-k SimRank Computations on Dynamic Graphs
    Liu, Yu
    Zheng, Bolong
    He, Xiaodong
    Wei, Zhewei
    Xiao, Xiaokui
    Zheng, Kai
    Lu, Jiaheng
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2017, 11 (01): : 14 - 26
  • [25] Upper bounds minimum-cost for single-source uncapacitated concave network flow problems
    Fontes, DBMM
    Hadjiconstantinou, E
    Christofides, N
    NETWORKS, 2003, 41 (04) : 221 - 228
  • [26] Low-cost single-source 17 level multilevel inverter with reduced switch count
    Karakilic, Murat
    Zeynalov, Javanshir
    Hatas, Hasan
    ENGINEERING RESEARCH EXPRESS, 2025, 7 (01):
  • [27] A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
    Fontes, Dalila B. M. M.
    Hadjiconstantinou, Eleni
    Christofides, Nicos
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 174 (02) : 1205 - 1219
  • [28] Protein-fold recognition using an improved single-source K diverse shortest paths algorithm
    Lhota, John
    Xie, Lei
    PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS, 2016, 84 (04) : 467 - 472
  • [29] A genetic algorithm with local search for solving single-source single-sink nonlinear non-convex minimum cost flow problems
    Ghasemishabankareh, Behrooz
    Ozlen, Melih
    Li, Xiaodong
    Deb, Kalyanmoy
    SOFT COMPUTING, 2020, 24 (02) : 1153 - 1169
  • [30] A genetic algorithm with local search for solving single-source single-sink nonlinear non-convex minimum cost flow problems
    Behrooz Ghasemishabankareh
    Melih Ozlen
    Xiaodong Li
    Kalyanmoy Deb
    Soft Computing, 2020, 24 : 1153 - 1169
1234