{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T05:11:17Z","timestamp":1668921077541},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T00:00:00Z","timestamp":1600387200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T00:00:00Z","timestamp":1600387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s00453-020-00766-8","type":"journal-article","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T15:03:47Z","timestamp":1600441427000},"page":"576-588","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constrained Minimum Passage Time in Random Geometric Graphs"],"prefix":"10.1007","volume":"83","author":[{"given":"Ghurumuruhan","family":"Ganesan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,18]]},"reference":[{"key":"766_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"N Alon","year":"2008","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. Wiley Interscience, New Jersy (2008)"},{"key":"766_CR2","first-page":"1412","volume":"2010","author":"M Bradonjic","year":"2010","unstructured":"Bradonjic, M., Elsasser, R., Friedrich, T., Sauerwald, T., Stauffer, A.: Efficient Broadcast on Random Geometric Graphs. Proc. SODA 2010, 1412\u20131421 (2010)","journal-title":"Proc. SODA"},{"key":"766_CR3","first-page":"1","volume":"2017","author":"R Ferrero","year":"2017","unstructured":"Ferrero, R., Gandino, F.: Analysis of random geometric graph for wireless network configuration. Proc. ICMU 2017, 1\u20136 (2017)","journal-title":"Proc. ICMU"},{"key":"766_CR4","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1109\/TIT.2006.890791","volume":"53","author":"M Franceschetti","year":"2007","unstructured":"Franceschetti, M., Dousse, O., Tse, D.N.C., Thiran, P.: Closing Gap in the Capacity of Wireless Networks via Percolation Theory. IEEE Trans. Inf. Theory 53, 1009\u20131018 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"766_CR5","volume-title":"Asymptotic Theory of Extreme Order Statistics","author":"J Galambos","year":"1978","unstructured":"Galambos, J.: Asymptotic Theory of Extreme Order Statistics. Wiley, New Jersy (1978)"},{"key":"766_CR6","first-page":"377","volume":"2003","author":"SR Gandham","year":"2003","unstructured":"Gandham, S.R., Dawande, M., Prakash, R., Venkatesan, S.: Energy efficient schemes for wireless sensor networks with multiple mobile base stations. Proc. GLOBECOM 2003, 377\u2013381 (2003)","journal-title":"Proc. GLOBECOM"},{"key":"766_CR7","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1239\/aap\/1427814586","volume":"47","author":"G Ganesan","year":"2015","unstructured":"Ganesan, G.: Infection spread in random geometric graphs. Adv. Appl. Probab. 47, 164\u2013181 (2015)","journal-title":"Adv. Appl. Probab."},{"key":"766_CR8","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/s00453-016-0253-5","volume":"80","author":"G Ganesan","year":"2018","unstructured":"Ganesan, G.: Stretch and diameter in random geometric graphs. Algorithmica 80, 300\u2013330 (2018)","journal-title":"Algorithmica"},{"key":"766_CR9","doi-asserted-by":"crossref","unstructured":"Gupta, P., Kumar, P.R.: Critical Power for Asymptotic Connectivity in Wireless Networks, pp. 2203\u20132214. Stochastic Analysis, Control, Optimization and Applications (1998)","DOI":"10.1007\/978-1-4612-1784-8_33"},{"key":"766_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511895357","volume-title":"Continuum Percolation","author":"R Meester","year":"1996","unstructured":"Meester, R., Roy, R.: Continuum Percolation. Cambridge University Press, Cambridge (1996)"},{"key":"766_CR11","first-page":"989","volume":"2005","author":"S Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S., Pandurangan, G.: The bin-covering technique for thresholding random geometric graph properties. Proc. SODA 2005, 989\u2013998 (2005)","journal-title":"Proc. SODA"},{"key":"766_CR12","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"M Penrose","year":"2003","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)"},{"key":"766_CR13","doi-asserted-by":"publisher","first-page":"2012","DOI":"10.1109\/TCOMM.2013.021913.120595","volume":"61","author":"D Zennaro","year":"2013","unstructured":"Zennaro, D., Ahmad, A., Vangelista, L., Serpedin, E., Nounou, H., Nounou, M.: Network-wide clock synchronization via message passing with exponentially distributed link delays. IEEE Trans. Commun. 61, 2012\u20132024 (2013)","journal-title":"IEEE Trans. Commun."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00766-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00766-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00766-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,19]],"date-time":"2022-11-19T04:27:53Z","timestamp":1668832073000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00766-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,18]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["766"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00766-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,18]]},"assertion":[{"value":"9 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}