Strongly Polynomial Algorithms for the Unsplittable Flow Problem-Reference-Cited by-同舟云学术

Strongly Polynomial Algorithms for the Unsplittable Flow Problem

Published:2001 Issue: Volume: Page:15-29
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Azar Yossi,Regev Oded

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45535-3_2

Reference14 articles.

1. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive online routing. In 34th IEEE Symposium on Foundations of Computer Science, pages 32–40, 1993.

2. A. Baveja and A. Srinivasan. Approximation algorithms for disjoint paths and related routing and packing problems. To appear in Mathematics of Operations Research.

3. A. Borodin and R. El-Yaniv. Online computation and competitive analysis (cam-bridge university press, 1998). SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory), 29, 1998.

4. S. Fortune, J. Hopcroft, and J. Wyllie. The directed homeomorphism problem. Theoretical Computer Science, 10:111–121, 1980.

5. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. Proc. of STOC’ 99, pages 19–28.

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

1. Stochastic Decentralized Routing of Unsplittable Vehicle Flows Using Constraint Optimization;Distributed Computing and Artificial Intelligence;2013

2. Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs;Combinatorica;2010-09

3. A fast heuristic algorithm for the maximum concurrent k-splittable flow problem;Optimization Letters;2009-10-02

4. A self-adaptive key flow routing adjustment algorithm;Frontiers of Electrical and Electronic Engineering in China;2009-05-28

5. An exact approach for the maximum concurrent k-splittable flow problem;Optimization Letters;2007-06-28