Maximum Flows on Disjoint Paths-Reference-Cited by-同舟云学术

Maximum Flows on Disjoint Paths

Published:2010 Issue: Volume: Page:326-337
ISSN:0302-9743
Container-title:Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
language:
Short-container-title:

Author:

Naves Guyslain,Sonnerat Nicolas,Vetta Adrian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15369-3_25.pdf

Reference13 articles.

1. Andrews, M., Chuzhoy, J., Guruswami, V., Khanna, S., Talwar, K., Zhang, L.: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Electronic Colloquium on Computational Complexity 14(113) (2007)

2. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)

3. Chekuri, C., Khanna, S., Shepherd, B.: Edge-disjoint paths in planar graphs with constant congestion. SIAM J. Computing 39(1), 281–301 (2009)

4. Chuzhoy, J., Guruswami, V., Khanna, S., Talwar, K.: Hardness of routing with congestion in directed graphs. In: Proceedings of the 39th ACM Symposium on Theory of Computing, STOC (2007)

5. Dinitz, Y., Garg, N., Goemans, M.: On the single-source unsplittable flow problem. Combinatorica 19, 17–41 (1999)

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

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

2. The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems;Theory of Computing;2017