Finding two disjoint paths in a network with normalized α +-MIN-SUM objective function

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3827 LNCS, Issue , 2005, Pages 954-963

  Yang, Bing ^a   Zheng, S Q ^a   Lu, Enyue ^b  

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

^b SALISBURY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; INTEGER PROGRAMMING; OPTIMAL CONTROL SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

DISJOINT PATHS; INTEGER LINEAR PROGRAMMING; POLYNOMIAL-TIME ALGORITHMS;

FUNCTION EVALUATION;

EID: 33744961956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_95     Document Type: Conference Paper

References (15)

1. F. Harary, Graph Theory, Addison-Wesley, 1972.
2. S. Even, Graph Algorithms, Computer Science (1979).
3. L.R. Ford and D.R. Fulkerson, Flows in Networks, Princeton, 1962.
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. S. Fortune, J. Hopcroft, and J. Wyllie, "The directed subgraph homeomorphism problem ", Theoret. Comput. Sci., 10 (1980), 111-121.
7. B. Yang, S.Q. Zheng and S. Katukam, "Finding Two Disjoint Paths in a Network with Min-Min Objective Function ", Proceedings of the 15th IASTED International Conference on Parallel and Distributed Computing and Systems, (2003), 75-80.
8. --Min-Sum Objective Function ", Manuscript.
9. Y. Perl and Y. Shiloach, "Finding Two Disjoint Paths between Two Pairs of Vertices in a Graph ", J. ACM, 25(1) (1978), 1-9.
10. Y. Shiloach, A polynomial solution to the undirected two paths problem. J. ACM 27(3) (1980) 445-456.
11. J. W. Suurballe, "Disjoint Paths in a Network ", Networks 4 (1974), 125-145.
12. J. W. Suurballe and R. E. Tarjan, "A Quick Method for Finding Shortest Pairs of Disjoint Paths ", Networks 14 (1984), 325-336.
13. J. M. Kleinberg, "Single-source unsplittable flow. ", Proceedings of the 37th Annual Symposium on foundations of Computer Science (1996) 68-77.
14. F. Fallah, S. Liao, S. Devadas, "Solving Covering Problems Using LPR-Based Lower Bounds ", IEEE Transactions on Very Large Scale Integration (VLSI) Systems 8(1) (2000), 9-17.
15. F. Fallah, S. Devadas, K. Keutzer, "Functional Vector Generation for HDL Models Using Linear Programming and Boolean Satisfiability ", IEEE Transactions on computer Aided Design of Integrated Circuits and Systems, 20(8) (2001), 994-1002.