Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs-Reference-Cited by-同舟云学术

Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs

Published:2010-09 Issue:5 Volume:30 Page:485-520
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Andrews Matthew,Chuzhoy Julia,Guruswami Venkatesan,Khanna Sanjeev,Talwar Kunal,Zhang Lisa

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/s00493-010-2455-9.pdf

Reference39 articles.

1. M. Andrews: Hardness of buy-at-bulk network design, in: Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pages 115–124, Rome, Italy, October 2004.

2. M. Andrews, J. Chuzhoy, S. Khanna and L. Zhang: Hardness of the undirected edge-disjoint paths problem with congestion, in: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 226–244, 2005.

3. M. Andrews and L. Zhang: Hardness of the undirected edge-disjoint paths problem, in: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 276–283, 2005.

4. M. Andrews and L. Zhang: Hardness of the undirected congestion minimization problem, in: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 284–293, 2005.

5. M. Andrews and L. Zhang: Hardness of the edge-disjoint paths problem with congestion, Manuscript, 2005. Available at: ]http://ect.bell-labs.com/who/dmandrews/publications/edp-congestion.ps .

Cited by 38 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximating Maximum Integral Multiflows on Bounded Genus Graphs;Discrete & Computational Geometry;2023-10-09

2. Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary Demands;IEEE/ACM Transactions on Networking;2023

3. Packing Directed Cycles Quarter- and Half-Integrally;Combinatorica;2022-09-21

4. Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands;ACM SIGMETRICS Performance Evaluation Review;2022-03-22

5. Randomized rounding algorithms for large scale unsplittable flow problems;Journal of Heuristics;2021-09-09