{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:41:55Z","timestamp":1725795715613},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_33","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T08:37:49Z","timestamp":1402475869000},"page":"387-398","source":"Crossref","is-referenced-by-count":9,"title":["Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints"],"prefix":"10.1007","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","reference":[{"issue":"3","key":"33_CR1","doi-asserted-by":"publisher","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 & Applications\u00a046(3), 213\u2013218 (2013)","journal-title":"Comput. Geom.: Theory & Applications"},{"issue":"1","key":"33_CR2","doi-asserted-by":"publisher","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 & Applications\u00a046(1), 17\u201328 (2013)","journal-title":"Comput. Geom.: Theory & Applications"},{"issue":"6-7","key":"33_CR3","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.comgeo.2008.11.004","volume":"42","author":"E.M. 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 & Applications\u00a042(6-7), 582\u2013605 (2009)","journal-title":"Comput. Geom.: Theory & Applications"},{"issue":"5","key":"33_CR4","doi-asserted-by":"publisher","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\u00a045(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"issue":"9","key":"33_CR5","doi-asserted-by":"publisher","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 & Applications\u00a046(9), 1017\u20131026 (2013)","journal-title":"Comput. Geom.: Theory & Applications"},{"issue":"4","key":"33_CR6","doi-asserted-by":"publisher","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 Journal Discrete Mathematics\u00a023(4), 1655\u20131666 (2009)","journal-title":"SIAM Journal Discrete Mathematics"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-22300-6_12","volume-title":"Algorithms and Data Structures","author":"P. Bose","year":"2011","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. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 134\u2013146. Springer, Heidelberg (2011)"},{"key":"33_CR8","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 Sympos. on Parallelism in Algorithms and Architectures, pp. 344\u2013351 (2008)","DOI":"10.1145\/1378533.1378592"},{"issue":"9","key":"33_CR9","doi-asserted-by":"publisher","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 & Applications\u00a044(9), 477\u2013485 (2011)","journal-title":"Comput. Geom.: Theory & Applications"},{"issue":"2","key":"33_CR10","first-page":"177","volume":"32","author":"T.M. Chan","year":"2004","unstructured":"Chan, T.M.: Euclidean bounded-degree spanning tree ratios. Discrete & Computational Geometry\u00a032(2), 177\u2013194 (2004)","journal-title":"Discrete & Computational Geometry"},{"key":"33_CR11","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 Conf. on Discrete Mathematics and Computational Geometry (2013)"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., Pach, J., T\u00f3th, G.: Drawing Hamiltonian cycles with no large angles. Electronic Journal of Combinatorics\u00a019(2), P31 (2012)","DOI":"10.37236\/2356"},{"issue":"1","key":"33_CR13","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\u00a031(1), 1\u201328 (2001)","journal-title":"Algorithmica"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0925-7721(96)00012-0","volume":"8","author":"S.P. Fekete","year":"1997","unstructured":"Fekete, S.P., Woeginger, G.J.: Angle-restricted tours in the plane. Comput. Geom.: Theory & Applications\u00a08, 195\u2013218 (1997)","journal-title":"Comput. Geom.: Theory & Applications"},{"issue":"4","key":"33_CR15","doi-asserted-by":"publisher","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 Journal on Computing\u00a011(4), 676\u2013686 (1982)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"33_CR16","doi-asserted-by":"publisher","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. Discrete Applied Mathematics\u00a0157(5), 960\u2013970 (2009)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"33_CR17","doi-asserted-by":"publisher","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 Journal on Computing\u00a025(2), 355\u2013368 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"33_CR18","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, ch. 3, Springer"},{"issue":"4","key":"33_CR19","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1137\/S0097539796309764","volume":"28","author":"J.S.B. 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 Journal on Computing\u00a028(4), 1298\u20131309 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"33_CR20","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0196-6774(84)90029-4","volume":"5","author":"C.H. Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Vazirani, U.V.: On two geometric problems related to the travelling salesman problem. Journal of Algorithms\u00a05(2), 231\u2013246 (1984)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T21:48:39Z","timestamp":1597960119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}