Author:
Kuipers Fernando,Orda Ariel,Raz Danny,Van Mieghem Piet
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco (1979)
2. Goel, A., Ramakrishnan, K.G., Kataria, D., Logothetis, D.: Efficient Computation of Delay-sensitive Routes from One Source to All Destinations. In: Proc. of IEEE INFOCOM, pp. 854–858 (2001)
3. Hassin, R.: Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research 17(1), 36–42 (1992)
4. Kuipers, F.A., Van Mieghem, P.: The impact of correlated link weights on QoS routing. In: Proc. of the IEEE INFOCOM Conference, vol. 2, pp. 1425–1434 (April 2003)
5. Kuipers, F.A., Korkmaz, T., Krunz, M., Van Mieghem, P.: Performance Evaluation of Constraint-Based Path Selection Algorithms. IEEE Network 18(5), 16–23 (2004)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献