{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T23:40:03Z","timestamp":1748734803526,"version":"3.41.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T00:00:00Z","timestamp":1451347200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T00:00:00Z","timestamp":1451347200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["N66001-12-1-4218"],"award-info":[{"award-number":["N66001-12-1-4218"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000141210719"],"award-info":[{"award-number":["N000141210719"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["CMMI-1234585"],"award-info":[{"award-number":["CMMI-1234585"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10479-015-2093-0","type":"journal-article","created":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T08:06:31Z","timestamp":1451376391000},"page":"41-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Geometric partitioning and robust ad-hoc network design"],"prefix":"10.1007","volume":"238","author":[{"given":"John Gunnar","family":"Carlsson","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Behroozi","sequence":"additional","affiliation":[]},{"given":"Xiang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,29]]},"reference":[{"key":"2093_CR1","doi-asserted-by":"crossref","unstructured":"Alzoubi, K. M., Wan, P.-J., & Frieder, O. (2002) Message-optimal connected dominating sets in mobile ad hoc networks. In Proceedings of the 3rd ACM international symposium on mobile ad hoc networking and computing, (pp 157\u2013164).","DOI":"10.1145\/513800.513820"},{"issue":"3","key":"2093_CR2","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s00453-007-9125-3","volume":"54","author":"B Aronov","year":"2009","unstructured":"Aronov, B., Carmi, P., & Katz, M. J. (2009). Minimum-cost load-balancing partitions. Algorithmica, 54(3), 318\u2013336.","journal-title":"Algorithmica"},{"issue":"6","key":"2093_CR3","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/0031-3203(81)90002-9","volume":"13","author":"D Avis","year":"1981","unstructured":"Avis, D., & Toussaint, G. T. (1981). An efficient algorithm for decomposing a polygon into star-shaped polygons. Pattern Recognition, 13(6), 395\u2013398.","journal-title":"Pattern Recognition"},{"issue":"1","key":"2093_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.comgeo.2005.06.003","volume":"34","author":"S Bereg","year":"2006","unstructured":"Bereg, S., Bose, P., & Kirkpatrick, D. (2006). Equitable subdivisions within polygonal regions. Computational Geometry, 34(1), 20\u201327.","journal-title":"Computational Geometry"},{"issue":"1","key":"2093_CR5","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10479-008-0339-9","volume":"167","author":"O Berman","year":"2009","unstructured":"Berman, O., Drezner, Z., Tamir, A., & Wesolowsky, G. O. (2009). Optimal location with equitable loads. Annals of Operations Research, 167(1), 307\u2013325.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2093_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10479-005-2041-5","volume":"136","author":"J Brimberg","year":"2005","unstructured":"Brimberg, J., & Salhi, S. (2005). A continuous location-allocation problem with zone-dependent fixed cost. Annals of Operations Research, 136(1), 99\u2013115.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"2093_CR7","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1287\/ijoc.1110.0479","volume":"24","author":"JG Carlsson","year":"2012","unstructured":"Carlsson, J. G. (2012). Dividing a territory among several vehicles. INFORMS Journal on Computing, 24(4), 565\u2013577.","journal-title":"INFORMS Journal on Computing"},{"key":"2093_CR8","unstructured":"Carlsson, J. G., Ge, D., Subramaniam, A., & Ye. Y. (2007). Solving the min\u2013max multi-depot vehicle routing problem. In Proceedings of the FIELDS workshop on global optimization."},{"issue":"3","key":"2093_CR9","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1016\/j.ejor.2005.11.070","volume":"180","author":"D Haugland","year":"2007","unstructured":"Haugland, D., Ho, S. C., & Laporte, G. (2007). Designing delivery districts for the vehicle routing problem with stochastic demands. European Journal of Operational Research, 180(3), 997\u20131010.","journal-title":"European Journal of Operational Research"},{"key":"2093_CR10","unstructured":"Hochbaum, D. S. (1997). Approximation algorithms for NP-hard problems, volume 20. PWS publishing company Boston."},{"issue":"1","key":"2093_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0166-218X(99)00130-4","volume":"99","author":"JBM Melissen","year":"2000","unstructured":"Melissen, J. B. M., & Schuur, P. C. (2000). Covering a rectangle with six and seven circles. Discrete Applied Mathematics, 99(1), 149\u2013156.","journal-title":"Discrete Applied Mathematics"},{"issue":"8","key":"2093_CR12","doi-asserted-by":"publisher","first-page":"1834","DOI":"10.1109\/TAC.2011.2112410","volume":"56","author":"M Pavone","year":"2011","unstructured":"Pavone, M., Arsie, A., Frazzoli, E., & Bullo, F. (2011). Distributed algorithms for environment partitioning in mobile robotic networks. Automatic Control, IEEE Transactions on, 56(8), 1834\u20131848.","journal-title":"Automatic Control, IEEE Transactions on"},{"key":"2093_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: An introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata, F. P., & Shamos, M. I. (1985). Computational geometry: An introduction. New York: Springer."},{"key":"2093_CR14","doi-asserted-by":"crossref","unstructured":"Royer, E. M., Melliar-Smith, P. M., & Moser, L. E. (2001). An analysis of the optimum node density for ad hoc mobile networks. In IEEE International Conference on Communications, 2001. ICC 2001 (Vol. 3, pp. 857\u2013861).","DOI":"10.1109\/ICC.2001.937360"},{"issue":"7","key":"2093_CR15","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1109\/MCOM.2002.1018018","volume":"40","author":"I Stojmenovic","year":"2002","unstructured":"Stojmenovic, I. (2002). Position-based routing in ad hoc networks. IEEE Communications Magazine, 40(7), 128\u2013134.","journal-title":"IEEE Communications Magazine"},{"key":"2093_CR16","volume-title":"Algorithms on trees and graphs","author":"G Valiente","year":"2013","unstructured":"Valiente, G. (2013). Algorithms on trees and graphs. Berlin: Springer."},{"key":"2093_CR17","doi-asserted-by":"crossref","unstructured":"Wattenhofer, R., Li, L., Bahl, P., & Wang, Y.-M. (2001) Distributed topology control for power efficient operation in multihop wireless ad hoc networks. In INFOCOM 2001. Twentieth annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE (Vol. 3, pp. 1388\u20131397)","DOI":"10.1109\/INFCOM.2001.916634"},{"key":"2093_CR18","doi-asserted-by":"crossref","unstructured":"Wu J., & Li, H. (1999) On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications, (pp. 7\u201314).","DOI":"10.1145\/313239.313261"},{"issue":"2","key":"2093_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/TMI.1982.4307555","volume":"1","author":"DC Youla","year":"1982","unstructured":"Youla, D. C., & Webb, H. (1982). Image restoration by the method of convex projections: Part 1: Theory. IEEE Transactions on Medical Imaging, 1(2), 81\u201394.","journal-title":"IEEE Transactions on Medical Imaging"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2093-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2093-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2093-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2093-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T23:24:43Z","timestamp":1748733883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2093-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,29]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["2093"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2093-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2015,12,29]]},"assertion":[{"value":"29 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}