{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:53:44Z","timestamp":1725501224132},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372462"},{"type":"electronic","value":"9783540372486"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11814764_7","type":"book-chapter","created":{"date-parts":[[2008,1,14]],"date-time":"2008-01-14T20:59:16Z","timestamp":1200344356000},"page":"60-72","source":"Crossref","is-referenced-by-count":2,"title":["A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks"],"prefix":"10.1007","author":[{"given":"Andrea E. F.","family":"Clementi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miriam","family":"Di Ianni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Lauria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Monti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1111\/j.1475-3995.1999.tb00176.x","volume":"6","author":"L. Alfandari","year":"1999","unstructured":"Alfandari, L., Paschos, V.T.: Approximating minimum spanning tree of depth 2. Intl. Trans. In Op. Res.\u00a06, 607\u2013622 (1999)","journal-title":"Intl. Trans. In Op. Res."},{"key":"7_CR2","volume-title":"The probabilistic method","author":"N. Alon","year":"1992","unstructured":"Alon, N., Spencer, J.: The probabilistic method. Wiley, Chichester (1992)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean k-medians and related problems. In: Proc. 30-th ACM Symposium on Theory of Computing, pp. 106\u2013113 (1998)","DOI":"10.1145\/276698.276718"},{"key":"7_CR4","unstructured":"Chlebus, B., Gasienec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. In: Proc. of 11th ACM SODA (2000)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/3-540-48777-8_8","volume-title":"Integer Programming and Combinatorial Optimization","author":"F.A. Chudak","year":"1999","unstructured":"Chudak, F.A., Williamson, D.P.: Improved approximation algorithms for capacitated facility location problems. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol.\u00a01610, p. 99. Springer, Heidelberg (1999)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/B:MONE.0000013624.32948.87","volume":"9","author":"A.E.F. Clementi","year":"2004","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: On the Power Assignment Problem in Radio Networks. Mobile Networks and Applications (MONET)\u00a09, 125\u2013140 (2004)","journal-title":"Mobile Networks and Applications (MONET)"},{"key":"7_CR7","unstructured":"Clementi, A.E.F., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.: Some Recent Theoretical Advances and Open Questions on Energy Consumption in Static Ad-Hoc in Wireless Networks. In: Proc. of the 3rd Workshop ARACNE, Carleton Scientific (2002)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Di Ianni, M., Monti, A., Rossi, G., Silvestri, R.: Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. In: Proc. of the IEEE IPDPS-WMAN (2005)","DOI":"10.1109\/IPDPS.2005.210"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/11429647_9","volume-title":"Structural Information and Communication Complexity","author":"A.E.F. Clementi","year":"2005","unstructured":"Clementi, A.E.F., Di Ianni, M., Monti, A., Lauria, M., Rossi, G., Silvestri, R.: Divide and conquer is almost optimal for the bounded-hop MST problem on random euclidean instances. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.\u00a03499, pp. 89\u201398. Springer, Heidelberg (2005)"},{"key":"7_CR10","unstructured":"Ephremides, A., Nguyen, G.D., Wieselthier, J.E.: On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In: Proc. of the 19th INFOCOM, pp. 585\u2013594 (2000)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/0305-0548(94)00074-I","volume":"22","author":"L. Gouveia","year":"1995","unstructured":"Gouveia, L.: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints. Computers and Operations Research\u00a022, 959\u2013970 (1995)","journal-title":"Computers and Operations Research"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/0377-2217(95)00090-9","volume":"95","author":"L. Gouveia","year":"1996","unstructured":"Gouveia, L.: Multicommodity flow models for spanning trees with hop constraints. European Journal of Operational Research\u00a095, 178\u2013190 (1996)","journal-title":"European Journal of Operational Research"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1006\/jagm.1998.0993","volume":"31","author":"S. Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. Journal of Algorithms\u00a031, 228\u2013248 (1999)","journal-title":"Journal of Algorithms"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0377-2217(00)00143-0","volume":"132","author":"L. Gouveia","year":"2001","unstructured":"Gouveia, L., Requejo, C.: A new relaxation approach for the hop-constrain minimum spanning tree problem. European Journal of Operational Research\u00a0132, 539\u2013552 (2001)","journal-title":"European Journal of Operational Research"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Kesselman, A., Kowalski, D.R.: Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks. In: Proc. of the 2nd International Conference on Wireless on Demand Network Systems and Service, pp. 119\u2013124 (2005)","DOI":"10.1109\/WONS.2005.17"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L.M. Kirousis","year":"2000","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power Consumption in Packet Radio Networks. Theoretical Computer Science\u00a0243, 289\u2013305 (2000)","journal-title":"Theoretical Computer Science"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0166-218X(99)00111-0","volume":"93","author":"G. Kortsarz","year":"1999","unstructured":"Kortsarz, G., Peleg, D.: Approximating the weight of shallow Steiner trees. Discrete Applied Mathematics\u00a093, 265\u2013285 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR18","unstructured":"Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a Local Search Heuristic for Facility Location Problems. In: Proc. of the 9-th annual ACM-SIAM symposium on Discrete algorithms, pp. 1\u201310 (1998)"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1023\/B:MONE.0000048543.95178.f5","volume":"10","author":"E.L. Lloyd","year":"2005","unstructured":"Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.S.: Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks. Mobile Networks and Applications\u00a010, 19\u201334 (2005)","journal-title":"Mobile Networks and Applications"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-45753-4_20","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M. Mahdian","year":"2002","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: A 1.52-approximation algorithm for the uncapacitated facility location problem. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 229\u2013242. Springer, Heidelberg (2002)"},{"key":"7_CR21","volume-title":"Wireless Information Networks","author":"K. Pahlavan","year":"1995","unstructured":"Pahlavan, K., Levesque, A.: Wireless Information Networks. Wiley-Interscience, Chichester (1995)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Ramanathan, S., Lloyd, E.: Scheduling Broadcasts in multi-hop radio networks. IEEE\/ACM Trans. on Networking\u00a01 (1993)","DOI":"10.1109\/90.222924"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Ramanathan, R., Hain, R.: Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment. In: Proc of IEEE INFOCOM, pp. 404\u2013413 (2000)","DOI":"10.1109\/INFCOM.2000.832213"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Ramaswami, R., Parhi, K.: Distributed scheduling of broadcasts in radio networks. In: Proc of IEEE INFOCOM (1989)","DOI":"10.1109\/INFCOM.1989.101493"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Raidl, G.R., Julstrom, B.A.: Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. In: Proc. of the 2003 ACM symposium on Applied computing, pp. 747\u2013752 (2003)","DOI":"10.1145\/952532.952678"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. In: Proc. of the 29-th Annual ACM Symposium on Theory of Computing (STOC), pp. 265\u2013274 (1997)","DOI":"10.1145\/258533.258600"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1018967121276","volume":"86","author":"S. Voss","year":"1999","unstructured":"Voss, S.: The steiner tree problem with hop constraint. Annals of Operations Research\u00a086, 321\u2013345 (1999)","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Ad-Hoc, Mobile, and Wireless Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11814764_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T22:11:48Z","timestamp":1557180708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11814764_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372462","9783540372486"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11814764_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}