Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

被引：0
|
作者：
Guruswami, Venkatesan [1 ]
Khanna, Sanjeev [1 ]
Rajaraman, Rajmohan [1 ]
Shepherd, Bruce [1 ]
Yannakakis, Mihalis [1 ]
机构：
[1] MIT Lab for Computer Science, Cambridge, MA, United States
来源：
Conference Proceedings of the Annual ACM Symposium on Theory of Computing | 1999年
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
25
引用
收藏
页码：19 / 28
相关论文
共 50 条
  • [1] Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
    Guruswami, V
    Khanna, S
    Rajaraman, R
    Shepherd, B
    Yannakakis, M
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 67 (03) : 473 - 496
  • [2] Approximation algorithms for edge-disjoint paths and unsplittable flow
    Department of Computer Science, University of Leicester, United Kingdom
    [J]. Lect. Notes Comput. Sci., 2006, (97-134):
  • [3] Approximation algorithms for edge-disjoint paths and unsplittable flow
    Erlebach, T
    [J]. EFFICIENT APPROXIMATION AND ONLINE ALGORITHMS: RECENT PROGRESS ON CLASSICAL COMBINATORIAL OPTIMIZATION PROBLEMS AND NEW APPLICATIONS, 2006, 3484 : 97 - 134
  • [4] Approximation Algorithms for the Edge-Disjoint Paths Problem via Racke Decompositions
    Andrews, Matthew
    [J]. 2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2010, : 277 - 286
  • [5] Hardness of the undirected edge-disjoint paths problem with congestion
    Andrews, M
    Chuzhoy, J
    Khanna, S
    Zhang, L
    [J]. 46TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2005, : 226 - 241
  • [6] Logarithmic hardness of the undirected edge-disjoint paths problem
    Andrews, Matthew
    Zhang, Lisa
    [J]. JOURNAL OF THE ACM, 2006, 53 (05) : 745 - 761
  • [7] AN APPROXIMATION ALGORITHM FOR FULLY PLANAR EDGE-DISJOINT PATHS
    Huang, Chien-Chung
    Mari, Mathieu
    Mathieu, Claire
    Schewior, Kevin
    Vygen, Jens
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (02) : 752 - 769
  • [8] Exact Algorithms for Finding Partial Edge-Disjoint Paths
    Deng, Yunyun
    Guo, Longkun
    Huang, Peihuang
    [J]. COMPUTING AND COMBINATORICS (COCOON 2018), 2018, 10976 : 14 - 25
  • [9] Optimal construction of edge-disjoint paths in random graphs
    Broder, AZ
    Frieze, AM
    Suen, S
    Upfal, E
    [J]. SIAM JOURNAL ON COMPUTING, 1998, 28 (02) : 542 - 574
  • [10] Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
    Srinivasan, A
    [J]. 38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 416 - 425
12345