Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Alfandari, L., Paschos, V.T.: Approximating minimum spanning tree of depth 2. International Transactions in Operational Research 6(6), 607–622 (1999)
2. Lecture Notes in Computer Science;A.E.F. Clementi,2006
3. Clementi, A.E.F., Ianni, M.D., Monti, A., Rossi, G., Silvestri, R.: Divide and Conquer is almost optimal for the Bounded-Hop Accumulation in Ad Hoc Wireless Networks. In: The Proceedings of SIROCCO (2005)
4. Clementi, A.E.F., Ianni, M.D., Monti, A., Rossi, G., Silvestri, R.: Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. In: IPDPS 2005. Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (2005)
5. Clementi, A.E.F., Penna, M.D., Silvestri, R.: On the Power Assignment Problem in Radio Networks. Mobile Networks and Applications (MONET) 9, 125–140 (2004)