{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:43:49Z","timestamp":1725464629661},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642306419"},{"type":"electronic","value":"9783642306426"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30642-6_12","type":"book-chapter","created":{"date-parts":[[2012,8,11]],"date-time":"2012-08-11T08:01:39Z","timestamp":1344672099000},"page":"112-124","source":"Crossref","is-referenced-by-count":2,"title":["Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Dobrev","sequence":"first","affiliation":[]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[]},{"given":"Oscar Morales","family":"Ponce","sequence":"additional","affiliation":[]},{"given":"Milan","family":"Pl\u017e\u00edk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-006-0649-0","volume":"22","author":"D. Bauer","year":"2006","unstructured":"Bauer, D., Broersma, H., Schmeichel, E.: Toughness in graphs\u2013a survey. Graphs and Combinatorics\u00a022(1), 1\u201335 (2006)","journal-title":"Graphs and Combinatorics"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kaklamanis, C., Kranakis, E., Krizanc, D., Wiese, A.: Communication in wireless networks with directional antennae. In: 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2008), Munich, Germany, June 14-16, pp. 344\u2013351. IEEE\/ACM (2008)","DOI":"10.1145\/1378533.1378592"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-17461-2_6","volume-title":"Combinatorial Optimization and Applications","author":"S. Dobrev","year":"2010","unstructured":"Dobrev, S., Kranakis, E., Krizanc, D., Opatrny, J., Ponce, O.M., Stacho, L.: Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol.\u00a06509, pp. 72\u201386. Springer, Heidelberg (2010)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Francke, A., Hoffmann, M.: The euclidean degree-4 minimum spanning tree problem is np-hard. In: Proceedings of the 25th Annual Symposium on Computational Geometry, pp. 179\u2013188. ACM (2009)","DOI":"10.1145\/1542362.1542399"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Morales, O.: Maintaining connectivity in sensor networks using directional antennae. In: Nikoletseas, S., Rolim, J. (eds.) Theoretical aspects of Distributed Computing in Sensor Networks, ch. 3, pp. 59\u201384. Springer (2010) ISBN 978-3-642-14848-4","DOI":"10.1007\/978-3-642-14849-1_3"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02293049","volume":"8","author":"C. Monma","year":"1992","unstructured":"Monma, C., Suri, S.: Transitions in geometric minimum spanning trees. Discrete and Computational Geometry\u00a08(1), 265\u2013293 (1992)","journal-title":"Discrete and Computational Geometry"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"C.H. Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.H.: The euclidean travelling salesman problem is np-complete. Theoretical Computer Science\u00a04(3), 237\u2013244 (1977)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"12_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0167-6377(84)90077-4","volume":"2","author":"R.G. Parker","year":"1984","unstructured":"Parker, R.G., Rardin, R.L.: Guaranteed performance heuristics for the bottleneck traveling salesman problem. Operations Research Letters\u00a02(6), 269\u2013272 (1984)","journal-title":"Operations Research Letters"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G.T. Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recognition\u00a012(4), 261\u2013268 (1980)","journal-title":"Pattern Recognition"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30642-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T02:39:34Z","timestamp":1676774374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-30642-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642306419","9783642306426"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30642-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}