Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems-Reference-Cited by-同舟云学术

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

Published:2003-11 Issue:3 Volume:67 Page:473-496
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Guruswami Venkatesan,Khanna Sanjeev,Rajaraman Rajmohan,Shepherd Bruce,Yannakakis Mihalis

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference28 articles.

1. Y. Aumann, Y. Rabani, Improved bounds for all optical routing, Proceedings of 6th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1995, pp. 567–576.

2. Approximating low-congestion routing and column-restricted packing problems;Baveja;Information Processing Letters,2000

3. A. Bley, On the complexity of vertex-disjoint length-restricted path problems, Technical Report SC-98-20, Konrad-Zue-Zentrum für Informationstechnik, Berlin, 1998.

4. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations;Chernoff;Ann. of Math. Statist.,1952

5. Algorithm for solution of a problem of maximum flow in networks with power estimation;Dinitz;Soviet Math. Dokl.,1970

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

1. Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. SeamFlow: Seamless Flow Forwarding in Energy Harvesting-Enabled Access Points of SDWLAN;IEEE Transactions on Sustainable Computing;2023-01-01

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

4. Finding K dissimilar paths: Single-commodity and discretized flow formulations;Computers & Operations Research;2022-11

5. Incorporating Fairness in Large-scale Evacuation Planning;Proceedings of the 31st ACM International Conference on Information & Knowledge Management;2022-10-17