{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:18:06Z","timestamp":1773656286255,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,10,5]],"date-time":"2015-10-05T00:00:00Z","timestamp":1444003200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00453-015-0076-9","type":"journal-article","created":{"date-parts":[[2015,10,5]],"date-time":"2015-10-05T19:48:14Z","timestamp":1444074494000},"page":"349-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints"],"prefix":"10.1007","volume":"77","author":[{"given":"Rom","family":"Aschner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,5]]},"reference":[{"issue":"3","key":"76_CR1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.comgeo.2012.07.003","volume":"46","author":"E Ackerman","year":"2013","unstructured":"Ackerman, E., Gelander, T., Pinchasi, R.: Ice-creams and wedge graphs. Comput. Geom.: Theory Appl. 46(3), 213\u2013218 (2013)","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"1","key":"76_CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.comgeo.2012.03.002","volume":"46","author":"O Aichholzer","year":"2013","unstructured":"Aichholzer, O., Hackl, T., Hoffmann, M., Huemer, C., P\u00f3r, A., Santos, F., Speckmann, B., Vogtenhuber, B.: Maximizing maximal angles for plane straight-line graphs. Comput. Geom.: Theory Appl. 46(1), 17\u201328 (2013)","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"6\u20137","key":"76_CR3","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/j.comgeo.2008.11.004","volume":"42","author":"EM Arkin","year":"2009","unstructured":"Arkin, E.M., Fekete, S.P., Islam, K., Meijer, H., Mitchell, J.S.B., Rodr\u00edguez, Y.N., Polishchuk, V., Rappaport, D., Xiao, H.: Not being (super) thin or solid is hard: a study of grid Hamiltonicity. Comput. Geom.: Theory Appl. 42(6\u20137), 582\u2013605 (2009)","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"5","key":"76_CR4","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"76_CR5","doi-asserted-by":"crossref","unstructured":"Aschner, R., Katz, M.J.: Bounded-angle spanning tree: modeling networks with angular constraints. In: Proceeding of the 41st International Colloquium on Automata, Languages, and Programming (ICALP), pp. 387\u2013398 (2014)","DOI":"10.1007\/978-3-662-43951-7_33"},{"issue":"9","key":"76_CR6","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1016\/j.comgeo.2013.06.003","volume":"46","author":"R Aschner","year":"2013","unstructured":"Aschner, R., Katz, M.J., Morgenstern, G.: Symmetric connectivity with directional antennas. Comput. Geom.: Theory Appl. 46(9), 1017\u20131026 (2013)","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"4","key":"76_CR7","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1137\/080716931","volume":"23","author":"I B\u00e1r\u00e1ny","year":"2009","unstructured":"B\u00e1r\u00e1ny, I., P\u00f3r, A., Valtr, P.: Paths with no small angles. SIAM J. Discret. Math. 23(4), 1655\u20131666 (2009)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"76_CR8","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s00453-012-9739-y","volume":"69","author":"P Bose","year":"2014","unstructured":"Bose, P., Carmi, P., Damian, M., Flatland, R., Katz, M.J., Maheshwari, A.: Switching to directional antennas with constant increase in radius and hop distance. Algorithmica 69(2), 397\u2013409 (2014)","journal-title":"Algorithmica"},{"key":"76_CR9","doi-asserted-by":"crossref","unstructured":"Calinescu, G.: Min-power strong connectivity. In: Proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 67\u201380 (2010)","DOI":"10.1007\/978-3-642-15369-3_6"},{"key":"76_CR10","doi-asserted-by":"crossref","unstructured":"Calinescu, G., Mandoiu, I.I., Zelikovsky, A.: Symmetric connectivity with minimum power consumption in radio networks. In: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, pp. 119\u2013130 (2002)","DOI":"10.1007\/978-0-387-35608-2_11"},{"key":"76_CR11","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kaklamanis, C., Kranakis, E., Krizanc, D., Wiese, A.: Communication in wireless networks with directional antennas. In: 20th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 344\u2013351 (2008)","DOI":"10.1145\/1378533.1378592"},{"issue":"9","key":"76_CR12","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.comgeo.2011.05.003","volume":"44","author":"P Carmi","year":"2011","unstructured":"Carmi, P., Katz, M.J., Lotker, Z., Ros\u00e9n, A.: Connectivity guarantees for wireless networks with directional antennas. Comput. Geom.: Theory Appl. 44(9), 477\u2013485 (2011)","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"2","key":"76_CR13","first-page":"177","volume":"32","author":"TM Chan","year":"2004","unstructured":"Chan, T.M.: Euclidean bounded-degree spanning tree ratios. Discret. Comput. Geom. 32(2), 177\u2013194 (2004)","journal-title":"Discret. Comput. Geom."},{"key":"76_CR14","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: Hardness results for the power range assignment problem in packet radio networks. In: 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 197\u2013208 (1999)","DOI":"10.1007\/978-3-540-48413-4_21"},{"key":"76_CR15","unstructured":"Dobrev, S., Eftekhari, M., MacQuarrie, F., Manuch, J., Morales-Ponce, O., Narayanan, L., Opatrny, J., Stacho, L.: Connectivity with directional antennas in the symmetric communication model. In: Mexican Conference on Discrete Mathematics and Computational Geometry (2013)"},{"issue":"2","key":"76_CR16","doi-asserted-by":"crossref","first-page":"P31","DOI":"10.37236\/2356","volume":"19","author":"A Dumitrescu","year":"2012","unstructured":"Dumitrescu, A., Pach, J., T\u00f3th, G.: Drawing Hamiltonian cycles with no large angles. Electron. J. Comb. 19(2), P31 (2012)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"76_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-001-0016-8","volume":"31","author":"A Efrat","year":"2001","unstructured":"Efrat, A., Itai, A., Katz, M.J.: Geometry helps in bottleneck matching and related problems. Algorithmica 31(1), 1\u201328 (2001)","journal-title":"Algorithmica"},{"key":"76_CR18","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0925-7721(96)00012-0","volume":"8","author":"SP Fekete","year":"1997","unstructured":"Fekete, S.P., Woeginger, G.J.: Angle-restricted tours in the plane. Comput. Geom.: Theory Appl. 8, 195\u2013218 (1997)","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"4","key":"76_CR19","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676\u2013686 (1982)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"76_CR20","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1016\/j.dam.2008.03.037","volume":"157","author":"R Jothi","year":"2009","unstructured":"Jothi, R., Raghavachari, B.: Degree-bounded minimum spanning trees. Discret. Appl. Math. 157(5), 960\u2013970 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"76_CR21","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1137\/S0097539794264585","volume":"25","author":"S Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Young, N.E.: Low-degree spanning trees of small weight. SIAM J. Comput. 25(2), 355\u2013368 (1996)","journal-title":"SIAM J. Comput."},{"key":"76_CR22","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"LM Kirousis","year":"2000","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theor. Comput. Sci. 243, 289\u2013305 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"76_CR23","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Morales, O.: Maintaining connectivity in sensor networks using directional antennae. In: Nikoletseas, S., Rolim, J.D.P. (Eds.) Theoretical Aspects of Distributed Computing in Sensor Networks, Chapter 3. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-14849-1_3"},{"issue":"4","key":"76_CR24","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1137\/S0097539796309764","volume":"28","author":"JSB Mitchell","year":"1999","unstructured":"Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput. 28(4), 1298\u20131309 (1999)","journal-title":"SIAM J. Comput."},{"key":"76_CR25","unstructured":"van Nijnatten, F.: Range Assignment with Directional Antennas. Master\u2019s Thesis, Technische Universiteit Eindhoven (2008)"},{"issue":"2","key":"76_CR26","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0196-6774(84)90029-4","volume":"5","author":"CH Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Vazirani, U.V.: On two geometric problems related to the travelling salesman problem. J. Algorithms 5(2), 231\u2013246 (1984)","journal-title":"J. Algorithms"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0076-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0076-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0076-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0076-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,9]],"date-time":"2020-09-09T06:13:07Z","timestamp":1599631987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0076-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,5]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["76"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0076-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,5]]}}}