Finding Two Disjoint Paths in a Network with Min-Min Objective Function

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

Volumn 15, Issue 1, 2003, Pages 75-80

  Yang, Bing ^a   Zheng, S Q ^a   Katukam, Suresh ^b  

^a The University of Texas at Dallas   (United States)

^b CISCO SYSTEMS   (United States)

Author keywords

Algorithm; Complexity; Disjoint paths; Graph; Network; Reliability; Routing; Shortest path

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; RELIABILITY;

COMPLEXITY; DISJOINT PATH; ROUTING; SHORTEST PATH;

TELECOMMUNICATION NETWORKS;

EID: 1542537902     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman (1979).
2. F.Harary, Graph Theory, (Addison-Wesley, 1972).
3. A. Itai, Y. Perl and Y. Shiloach, "The Complexity of finding Maximum Disjoint Paths with Length Constraints", Networks 12 (1982) 277-286.
4. C. L. Li, S. T. McCormick, and D. Simchi-Levi, "The Complexity of Finding Two Disjoint Paths with Min-Max Objective Function", Discrete Appl. Math. 26(1) (1990), 105-115.
5. C. L. Li, S. T. McCormick, and D. Simchi-Levi, "Finding Disjoint Paths with Different Path-Costs: Complexity and Algorithms", Networks, 22 (1992), 653-667.
6. Y. Perl and Y. Shiloach, "Finding Two Disjoint Paths between Two Pairs of Vertices in a Graph", J. ACM, 25(1) (1978), 1-9.
7. J. W. Suurballe, "Disjoint Paths in a Network", Networks 4 (1974), 125-145.
8. J. W. Suurballe and R. E. Tarjan, "A Quick Method for Finding Shortest Pairs of Disjoint Paths", Networks 14 (1984), 325-336.