Author:
Kumar Rajeev,Banerjee Nilanjan
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. M. R. Garey and D. S. Johnson. Computers and Interactability: A Guide to the Theory of NP-Completeness, 1979. San Francisco, LA: Freeman.
2. D. Hochbaum (Ed.). Approximation Algorithms for NP-Hard problems, 1997. Boston, MA: PWS.
3. M. Gerla and L. Kleinrock. On the topological design of distributed computer networks. IEEE Trans. Communications, 25(1): 48–60, 1977.
4. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos. Multicast routing for multimedia communication. IEEE/ACM Trans. Networking, 286–292, 1993.
5. M. Borah, R. M. Owens, and M. J. Irwin. An edge-based heuristic for Steiner routing. IEEE Trans. Computer Aided Design of Integrated Circuits and Systems, 13(12): 1563–1568, 1995.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献