{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:26:24Z","timestamp":1742952384137,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319741796"},{"type":"electronic","value":"9783319741802"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-74180-2_5","type":"book-chapter","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T15:12:55Z","timestamp":1516029175000},"page":"59-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic Properties of Highly Connected Random Geometric Graphs"],"prefix":"10.1007","author":[{"given":"Bodo","family":"Manthey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor M. J. J.","family":"Reijnders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,16]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s11276-005-5275-x","volume":"12","author":"E Althaus","year":"2006","unstructured":"Althaus, E., C\u0103linescu, G., Mandoiu, I.I., Prasad, S., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks. Wireless Netw. 12(3), 287\u2013299 (2006)","journal-title":"Wireless Netw."},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/net.20310","volume":"55","author":"F Bendali","year":"2010","unstructured":"Bendali, F., Diarrassouba, I., Mahjoub, A.R., Didi Biha, M., Mailfert, J.: A branch-and-cut algorithm for the k-edge connected subgraph problem. Networks 55(1), 13\u201332 (2010)","journal-title":"Networks"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bettstetter, C.: On the minimum node degree and connectivity of a wireless multihop network. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 80\u201391. ACM (2002)","DOI":"10.1145\/513800.513811"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00453-012-9643-5","volume":"66","author":"M Bl\u00e4ser","year":"2013","unstructured":"Bl\u00e4ser, M., Manthey, B., Rao, B.V.R.: Smoothed analysis of partitioning algorithms for euclidean functionals. Algorithmica 66(2), 397\u2013418 (2013)","journal-title":"Algorithmica"},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/B:MONE.0000013624.32948.87","volume":"9","author":"AEF Clementi","year":"2004","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Mob. Netw. Appl. 9(2), 125\u2013140 (2004)","journal-title":"Mob. Netw. Appl."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-39611-6_21","volume-title":"Ad-Hoc, Mobile, and Wireless Networks","author":"G Calinescu","year":"2003","unstructured":"Calinescu, G., Wan, P.-J.: Range assignment for high connectivity in wireless ad hoc networks. In: Pierre, S., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2003. LNCS, vol. 2865, pp. 235\u2013246. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39611-6_21"},{"key":"5_CR7","unstructured":"Czumaj, A., Lingas, A.: On approximability of the minimum-cost k-connected spanning subgraph problem. In: Tarjan, R.E., Warnow, T.J. (eds.) Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 281\u2013290. ACM\/SIAM (1999)"},{"key":"5_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1002\/rsa.20714","volume":"51","author":"M de Graaf","year":"2017","unstructured":"de Graaf, M., Manthey, B.: Probabilistic analysis of power assignments. Random Struct. Algorithms 51(3), 483\u2013505 (2017)","journal-title":"Random Struct. Algorithms"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Monma, C.L., Stoer, M.: Polyhedral approaches to network survivability. In: Roberts, F., Hwang, F., Monma, C.L. (eds.) Proceedings of the Workshop on Reliability of Computer and Communication Networks. Series in Discrete Mathematics and Theoretical Computer Science, vol. 5, pp. 121\u2013141. American Mathematical Society (1991)","DOI":"10.1090\/dimacs\/005\/08"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1073\/pnas.33.2.25","volume":"33","author":"PL Hsu","year":"1947","unstructured":"Hsu, P.L., Robbins, H.: Complete convergence and the law of large numbers. Proc. Nat. Acad. Sci. 33(2), 25\u201331 (1947)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-540-31955-9_7","volume-title":"Network Analysis","author":"F Kammer","year":"2005","unstructured":"Kammer, F., T\u00e4ubig, H.: Connectivity. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol. 3418, pp. 143\u2013177. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31955-9_7"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S Khuller","year":"1994","unstructured":"Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. J. ACM 41(2), 214\u2013235 (1994)","journal-title":"J. ACM"},{"issue":"6","key":"5_CR14","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1524\/itit.2011.0654","volume":"53","author":"B Manthey","year":"2011","unstructured":"Manthey, B., R\u00f6glin, H.: Smoothed analysis: analysis of algorithms beyond worst case. IT \u2013 Inf. Technol. 53(6), 280\u2013286 (2011)","journal-title":"IT \u2013 Inf. Technol."},{"key":"5_CR15","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BFb0060120","volume-title":"The Many Facets of Graph Theory","author":"DW Matula","year":"1969","unstructured":"Matula, D.W.: The cohesive strength of graphs. In: Chartrand, G., Kapoor, S.F. (eds.) The Many Facets of Graph Theory. LNM, vol. 110, pp. 215\u2013221. Springer, Heidelberg (1969). https:\/\/doi.org\/10.1007\/BFb0060120"},{"key":"5_CR16","unstructured":"Redmond, C.: Boundary rooted graphs and euclidean matching algorithms. Ph.D. thesis, Lehigh University, Bethlehem, PA, USA (1993)"},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1214\/aoap\/1177005364","volume":"3","author":"WT Rhee","year":"1993","unstructured":"Rhee, W.T.: A matching problem and subadditive euclidean functionals. Ann. Appl. Probab. 3(3), 794\u2013801 (1993)","journal-title":"Ann. Appl. Probab."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Santi, P., Blough, D.M., Vainstein, F.: A probabilistic analysis for the range assignment problem in ad hoc networks. In: Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 212\u2013220. ACM (2001)","DOI":"10.1145\/501445.501446"},{"issue":"10","key":"5_CR19","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/1562764.1562785","volume":"52","author":"DA Spielman","year":"2009","unstructured":"Spielman, D.A., Teng, S.H.: Smoothed analysis: an attempt to explain the behavior of algorithms in practice. Commun. ACM 52(10), 76\u201384 (2009)","journal-title":"Commun. ACM"},{"key":"5_CR20","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0093472","volume-title":"Probability Theory of Classical Euclidean Optimization Problems","author":"JE Yukich","year":"1998","unstructured":"Yukich, J.E.: Probability Theory of Classical Euclidean Optimization Problems. LNM, vol. 1675. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0093472"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74180-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:50:43Z","timestamp":1709826643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-74180-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319741796","9783319741802"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74180-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/caldam2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}