On the inapproximability of disjoint paths and minimum steiner forest with bandwidth constraints

Journal of Computer and System Sciences

Volumn 60, Issue 1, 2000, Pages 1-12

  Ma, Bin ^a,b   Wang, Lusheng ^b  

^a PEKING UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037761744     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1661     Document Type: Article

References (16)

1. B. Awerbuch, Y. Azar, and S. Plotkin, Throughput-competitive online routing, in "Proc. 34th IEEE Symposium on Foundation of Computer Science, 1993," pp. 32-40.
2. N. Garg, V. Vazirani, and M. Yannakakis, Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover, in "Proc. International Colloq. on Automata, Languages, and Programming," Lecture Notes in Computer Science, Vol. 700, pp. 64-75, Springer-Verlag, Berlin, 1993.
3. 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, in "Proc. 31st ACM Symposium on Theory of Computing, 1999," pp. 19-28.
4. D. S. Hochbaum, "Approximation Algorithms for NP-hard Problems," PWS, Kent/Boston, 1997.
5. X. Jia and L. Wang, A group multicast routing algorithm by using multiple minimum Steiner trees, Comput. Commun. 20 (1997), 750-758.
6. R. M. Karp, Reducibility among combinatorial problems, in "Complexity of Computer Computations" (R. E. Miller and J. W. Thatcher, Eds.), Plenum Press, New York, 1972.
7. R. M. Karp, On the computational complexity of combinatorial problems, Networks 5 (1975), 45-68.
8. J. Kleinberg, "Approximation Algorithms for Disjoint Paths Problems," Ph.D. Thesis, Department of EECS, MIT, 1996.
9. J. Kleinberg and É. Tardos, Disjoint paths in densely embedded graphs, in "Proc. 36th IEEE Symposium on Foundations of Computer Science, 1995," pp. 52-61.
10. J. Kleinberg and É. Tardos, Approximations for the disjoint paths problem in high-diameter planar networks, in "Proc. 27th ACM Symposium on Theory of Computing, 1995," pp. 26-35.
11. J. Kleinberg and R. Rubinfeld, Short paths in expander graphs, in "Proc. 37th IEEE Symposium on Foundations of Computer Science, 1996," pp. 86-95.
12. S. G. Kolliopoulos and C. Stein, Approximating disjoint-path problems using greedy algorithms and packing integer programs, in "Proc. 6th Conference on Integer Programming and Combinatorial Optimization, 1998," pp. 153-168.
13. M. E. Kramer and J. van Leeuwen, The complexity of wire routing and finding the minimum area layouts for arbitrary VLSI circuits, in "Advances in Computing Research 2: VLSI Theory" (F. P. Preparata, Ed.), JAI Press, London, 1984.
14. D. B. Shmoys, C. Stein, and J. Wein, Improved approximation algorithms for shop scheduling problems, SIAM J. Comput. 23 (1994), 617-632.
15. A. Srinivasan, Improved approximations for edge-disjoint paths, unsplittable flow and related routing problems, in "Proc. 38th Ann. Symposium on Foundations of Computer Science, 1997," pp. 416-425.
16. C. Stein, "Approximation Algorithms for Multicommodity Flow and Shop Scheduling Problems," Ph.D. Thesis, MIT, Cambridge, MA, August 1992.