K-pair delay constrained minimum cost routing in undirected networks

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 230-231

  Chen, Guangting ^a   Xue, Guoliang ^b  

^a HANGZHOU DIANZI UNIVERSITY   (China)

^b University of Vermont ^*  (United States)

Author keywords

Algorithms; Performance; Reliability; Theory

Indexed keywords

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

References (7)

1. Jon Feldman, Matthias Ruhl, The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, p.299, October 17-18, 1999
2. M.R. Garey and D.S. Johnson, Computers and Intractability, 1979.
3. Roche A. Guérin , Ariel Orda, QoS routing in networks with inaccurate information: theory and algorithms, IEEE/ACM Transactions on Networking (TON), v.7 n.3, p.350-364, June 1999 [doi〉10.1109/90.779203]
4. Refael Hassin, Approximation schemes for the restricted shortest path problem, Mathematics of Operations Research, v.17 n.1, p.36-42, Feb. 1992
5. Oscar H. Ibarra , Chul E. Kim, Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems, Journal of the ACM (JACM), v.22 n.4, p.463-468, Oct. 1975 [doi〉10.1145/321906.321909]
6. S. Sahni, General techniques for combinatorial approximations, Oper. Resh., 35(1977), pp. 70-79.
7. Z. Wang and J. Crowcroft, Quality-of-service routing for supporting multimedia applications, IEEE JSAC, 14(1996), pp. 1228-1234.