{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T23:01:31Z","timestamp":1762210891887,"version":"3.41.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2017,9,8]],"date-time":"2017-09-08T00:00:00Z","timestamp":1504828800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Lynn and William Frankel Center for Computer Science"},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00453-017-0370-9","type":"journal-article","created":{"date-parts":[[2017,9,11]],"date-time":"2017-09-11T18:06:19Z","timestamp":1505153179000},"page":"3050-3077","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Bounded-Hop Communication Networks"],"prefix":"10.1007","volume":"80","author":[{"given":"Paz","family":"Carmi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7906-0297","authenticated-orcid":false,"given":"Lilach","family":"Chaitman-Yerushalmi","sequence":"additional","affiliation":[]},{"given":"Ohad","family":"Trabelsi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,8]]},"reference":[{"key":"370_CR1","doi-asserted-by":"crossref","unstructured":"Alt, H., Arkin, E.M., Br\u00f6nnimann, H., Erickson, J., Fekete, S.P., Knauer, C., Lenchner, J., Mitchell, J.S.B., Whittlesey, K.: Minimum-cost coverage of point sets by disks. In: Proceedings of the 22nd ACM Symposium on Computational Geometry, SOCG\u201906, pp. 449\u2013458 (2006)","DOI":"10.1145\/1137856.1137922"},{"issue":"1\u20132","key":"370_CR2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.tcs.2005.05.006","volume":"343","author":"C Amb\u00fchl","year":"2005","unstructured":"Amb\u00fchl, C., Clementi, A.E.F., Penna, P., Rossi, G., Silvestri, R.: On the approximability of the range assignment problem on radio networks in presence of selfish agents. Theor. Comput. Sci. 343(1\u20132), 27\u201341 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"370_CR3","doi-asserted-by":"crossref","unstructured":"Arora, S., Raghavan, P., Rao, S.: Approximation schemes for euclidean k-medians and related problems. In: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, STOC\u201998, pp. 106\u2013113 (1998)","DOI":"10.1145\/276698.276718"},{"key":"370_CR4","doi-asserted-by":"crossref","unstructured":"C\u0103linescu, G., Kapoor, S., Sarwat, M.: Bounded-hops power assignment in ad-hoc wireless networks. In: Proceedings of the IEEE Wireless Communications and Networking Conference, WCNC\u201904, pp. 1494\u20131499 (2004)","DOI":"10.1109\/WCNC.2004.1311664"},{"key":"370_CR5","doi-asserted-by":"crossref","unstructured":"Chambers, E.W., Fekete, S.P., Hoffmann, H.F., Marinakis, D., Mitchell, J.S.B., Srinivasan, V., Stege, U., Whitesides, S.: Connecting a set of circles with minimum sum of radii. In: Proceedings of the 12th International Symposium on Algorithms and Data Structures, WADS\u201911, pp. 183\u2013194 (2011)","DOI":"10.1007\/978-3-642-22300-6_16"},{"key":"370_CR6","doi-asserted-by":"crossref","unstructured":"Chen, J., Salim, M.B., Matsumoto, M.: Modeling the energy performance of object tracking in wireless sensor network using dual-sink. In: Proceedings of the 16th Asia-Pacific Conference on Communications, APCC\u201910, pp. 204\u2013209 (2010)","DOI":"10.1109\/APCC.2010.5679766"},{"issue":"299","key":"370_CR7","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1016\/S0304-3975(02)00538-8","volume":"1\u20133","author":"AEF Clementi","year":"2003","unstructured":"Clementi, A.E.F., Di Ianni, M., Silvestri, R.: The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theor. Comput. Sci. 1\u20133(299), 751\u2013761 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"370_CR8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s00453-002-0985-2","volume":"35","author":"AEF Clementi","year":"2003","unstructured":"Clementi, A.E.F., Penna, P., Ferreira, A., Perennes, S., Silvestri, R.: The minimum range assignment problem on linear radio networks. Algorithmica 35(2), 95\u2013110 (2003)","journal-title":"Algorithmica"},{"key":"370_CR9","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., Bedford (1990)"},{"key":"370_CR10","doi-asserted-by":"crossref","unstructured":"Gouvy, N., Elhafsi, E.H., Mitton, N., Zorbas, D.: Energy efficient multi-flow routing in mobile sensor networks. In: IEEE Wireless Communications and Networking Conference, WCNC\u201913, pp. 1968\u20131973 (2013)","DOI":"10.1109\/WCNC.2013.6554866"},{"key":"370_CR11","doi-asserted-by":"crossref","unstructured":"Gruber, M., Raidl, G.R.: Solving the euclidean bounded diameter minimum spanning tree problem by clustering-based (meta-)heuristics. In: Revised Selected Papers of the 12th International Conference on Computer Aided Systems Theory, EUROCAST\u201909, pp. 665\u2013672 (2009)","DOI":"10.1007\/978-3-642-04772-5_86"},{"issue":"3","key":"370_CR12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.jda.2008.11.006","volume":"7","author":"E Kantor","year":"2009","unstructured":"Kantor, E., Peleg, D.: Approximate hierarchical facility location and applications to the bounded depth steiner tree and range assignment problems. J. Discrete Algorithms 7(3), 341\u2013362 (2009)","journal-title":"J. Discrete Algorithms"},{"issue":"3\u20134","key":"370_CR13","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.ipl.2008.01.004","volume":"107","author":"S Laue","year":"2008","unstructured":"Laue, S., Matijevic, D.: Approximating k-hop minimum spanning trees in Euclidean metrics. Inf. Process. Lett. 107(3\u20134), 96\u2013101 (2008)","journal-title":"Inf. Process. Lett."},{"key":"370_CR14","doi-asserted-by":"crossref","unstructured":"Lev-Tov, N., Peleg, D.: Exact algorithms and approximation schemes for base station placement problems. In: Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, Turku, SWAT\u201902, pp. 90\u201399 (2002)","DOI":"10.1007\/3-540-45471-3_10"},{"issue":"4","key":"370_CR15","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.comnet.2004.08.012","volume":"47","author":"N Lev-Tov","year":"2005","unstructured":"Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Netw. 47(4), 489\u2013501 (2005)","journal-title":"Comput. Netw."},{"key":"370_CR16","first-page":"e1","volume":"3","author":"N Mitton","year":"2013","unstructured":"Mitton, N., Simplot-Ryl, D., Zheng, J.: Guaranteed delivery in k-anycast routing in multi-sinkwireless networks. Trans. Mobile Commun. Appl. 3, e1 (2013)","journal-title":"Trans. Mobile Commun. Appl."},{"key":"370_CR17","doi-asserted-by":"crossref","DOI":"10.1002\/0471738646","volume-title":"Wireless information networks","author":"K Pahlavan","year":"2005","unstructured":"Pahlavan, K.: Wireless information networks. Wiley, New York (2005)"},{"key":"370_CR18","doi-asserted-by":"crossref","unstructured":"Pellenz, M.E., Jamhour, E., Penna, M.C., Souza, R.D., de Oliveira Brante, G.G.: A power assignment method for multi-sink WSN with outage probability constraints. In: Proceedings of the 28th IEEE International Conference on Advanced Information Networking and Applications, AINA\u201914, pp. 533\u2013540 (2014)","DOI":"10.1109\/AINA.2014.65"},{"key":"370_CR19","doi-asserted-by":"crossref","unstructured":"Pouryazdanpanah, M.K., Anjomshoa, M., Salehi, A.S., Afroozeh, A., Moshfegh, M.G.: DS-VBF: dual sink vector-based routing protocol for underwater wireless sensor network. In: Proceedings of the 5th IEEE Control and System Graduate Research Colloquium, ICSGRC\u201914, pp. 227\u2013232 (2014)","DOI":"10.1109\/ICSGRC.2014.6908727"},{"key":"370_CR20","doi-asserted-by":"crossref","unstructured":"Sen, A., Das Gupta, M., De D.: Energy efficient layered cluster based hierarchical routing protocol with dual sink. In: Proceedings of the 5th International Conference on Computers and Devices for Communication, CODEC 2012, pp. 1\u20134 (2012)","DOI":"10.1109\/CODEC.2012.6509223"},{"issue":"5","key":"370_CR21","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1109\/TPDS.2012.143","volume":"24","author":"X Wang","year":"2013","unstructured":"Wang, X., Wang, J., Lu, K., Xu, Y.: GKAR: a novel geographic $${K}$$ K -anycast routing for wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 24(5), 916\u2013925 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"370_CR22","doi-asserted-by":"crossref","unstructured":"Wu, X., Chen, G.: Dual-sink: using mobile and static sinks for lifetime improvement in wireless sensor networks. In: Proceedings of the 16th IEEE International Conference on Computer Communications and Networks, ICCCN\u201907, pp. 1297\u20131302 (2007)","DOI":"10.1109\/ICCCN.2007.4318000"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0370-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0370-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0370-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T17:50:57Z","timestamp":1750873857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0370-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,8]]},"references-count":22,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["370"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0370-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,9,8]]}}}