Author:
Althaus E.,Călinescu G.,Măndoiu I. I.,Prasad S.,Tchervenski N.,Zelikovsky A.
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Computer Networks and Communications,Information Systems
Reference32 articles.
1. E. Althaus, G. Călinescu, I.I. Măndoiu, S. Prasad, N. Tchervenski and A.Z. Zelikovsky, Power efficient range assignment in ad-hoc wireless networks, in: Proc. IEEE Wireless Communications and Networking Conference (WCNC) (2003) pp. 1889–1894.
2. P. Berman and V. Ramaiyer, Improved approximations for the Steiner tree problem, Journal of Algorithms 17 (1994) 381–408.
3. D.M. Blough, M. Leoncini, G. Resta and P. Santi, On the symmetric range assignment problem in wireless ad hoc networks, in: 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), (Kluwer Academic Publishers, 2002) pp. 71–82.
4. A. Borchers and D.-Z. Du, The k-Steiner ratio in graphs, SIAM Journal on Computing 26 (1997) 857–869.
5. P.M. Camerini, G. Galbiati and F. Maffioli, Random pseudo-polynomial algorithms for exact matroid problems, Journal of Algorithms 13 (1992) 258–273.
Cited by
63 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献