{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:16:33Z","timestamp":1725880593273},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_16","type":"book-chapter","created":{"date-parts":[[2017,2,20]],"date-time":"2017-02-20T01:12:36Z","timestamp":1487553156000},"page":"204-216","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs"],"prefix":"10.1007","author":[{"given":"Hugo A.","family":"Akitaya","sequence":"first","affiliation":[]},{"given":"Rajasekhar","family":"Inkulu","sequence":"additional","affiliation":[]},{"given":"Torrie L.","family":"Nichols","sequence":"additional","affiliation":[]},{"given":"Diane L.","family":"Souvaine","sequence":"additional","affiliation":[]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[]},{"given":"Charles R.","family":"Winston","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.comgeo.2007.09.001","volume":"40","author":"M Abellanas","year":"2008","unstructured":"Abellanas, M., Garc\u00eda, A., Hurtado, F., Tejel, J., Urrutia, J.: Augmenting the connectivity of geometric graphs. Comput. Geom. 40, 220\u2013230 (2008)","journal-title":"Comput. Geom."},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-319-27261-0_52","volume-title":"Graph Drawing and Network Visualization","author":"HA Akitaya","year":"2015","unstructured":"Akitaya, H.A., Castello, J., Lahoda, Y., Rounds, A., T\u00f3th, C.D.: Augmenting planar straight line graphs to 2-edge-connectivity. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 563\u2013564. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-27261-0_52"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Akitaya, H.A., Inkulu, T., Nichols, T.L., Souvaine, D.L., T\u00f3th, C.D., Winston, C.R.: Minimum weight connectivity augmentation for planar straight-line graphs. Preprint, arXiv:1612.04780 (2016)","DOI":"10.1007\/978-3-319-53925-6_16"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/S0196-6774(03)00090-7","volume":"49","author":"B Bespamyatnikh","year":"2003","unstructured":"Bespamyatnikh, B.: Computing homotopic shortest paths in the plane. J. Algorithms 49, 284\u2013303 (2003)","journal-title":"J. Algorithms"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1142\/S0218195912500045","volume":"22","author":"M Berg de","year":"2012","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22, 187\u2013205 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"16_CR6","first-page":"316","volume":"6","author":"DZ Chen","year":"2015","unstructured":"Chen, D.Z., Wang, H.: A new algorithm for computing visibility graphs of polygonal obstacles in the plane. J. Comput. Geom. 6, 316\u2013345 (2015)","journal-title":"J. Comput. Geom."},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-29344-3_22","volume-title":"LATIN 2012: Theoretical Informatics","author":"S Dobrev","year":"2012","unstructured":"Dobrev, S., Kranakis, E., Krizanc, D., Morales-Ponce, O., Stacho, L.: Approximating the edge length of 2-edge connected planar geometric graphs on a set of points. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 255\u2013266. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29344-3_22"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.comgeo.2006.03.003","volume":"35","author":"A Efrat","year":"2006","unstructured":"Efrat, A., Kobourov, S.G., Lubiw, A.: Computing homotopic shortest paths efficiently. Comput. Geom. 35, 162\u2013172 (2006)","journal-title":"Comput. Geom."},{"key":"16_CR9","series-title":"Oxford Lecture Series in Mathematics and Its Applications","volume-title":"Connections in Combinatorial Optimization","author":"A Frank","year":"2011","unstructured":"Frank, A.: Connections in Combinatorial Optimization. Oxford Lecture Series in Mathematics and Its Applications, vol. 12. Oxford University Press, Oxford (2011)"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"GN Frederickson","year":"1981","unstructured":"Frederickson, G.N., Ja\u2019Ja\u2019, J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 10, 270\u2013283 (1981)","journal-title":"SIAM J. Comput."},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-10217-2_29","volume-title":"Combinatorial Algorithms","author":"C Gutwenger","year":"2009","unstructured":"Gutwenger, C., Mutzel, P., Zey, B.: Planar biconnectivity augmentation with fixed embedding. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol. 5874, pp. 289\u2013300. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-10217-2_29"},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0925-7721(94)90010-8","volume":"4","author":"J Hershberger","year":"1994","unstructured":"Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Comput. Geom. 4, 63\u201398 (1994)","journal-title":"Comput. Geom."},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-1-4614-0110-0_17","volume-title":"Thirty Essays on Geometric Graph Theory","author":"F Hurtado","year":"2013","unstructured":"Hurtado, F., T\u00f3th, C.D.: Plane geometric graph augmentation: a generic perspective. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 327\u2013354. Springer, Heidelberg (2013)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/BFb0028270","volume-title":"Algorithms and Data Structures","author":"G Kant","year":"1991","unstructured":"Kant, G., Bodlaender, H.L.: Planar graph augmentation problems. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 286\u2013298. Springer, Heidelberg (1991). doi: 10.1007\/BFb0028270"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Kortsarz, G., Nutov, Z.: A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. ACM Trans. Algorithms 12, Article no. 23 (2016)","DOI":"10.1145\/2786981"},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Kranakis, E., Krizanc, D., Ponce, O.M., Stacho, L.: Bounded length 2-edge augmentation of geometric planar graphs. Discret. Math. Algorithms Appl. 4(3) (2012). doi: 10.1142\/S179383091250036X","DOI":"10.1142\/S179383091250036X"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Overmars, M.H., Welzl, E.: New methods for computing visibility graphs. In: Proceedings of 14th Symposium on Computational Geometry, pp. 164\u2013171. ACM Press, New York (1988)","DOI":"10.1145\/73393.73410"},{"key":"16_CR18","doi-asserted-by":"crossref","first-page":"599","DOI":"10.7155\/jgaa.00275","volume":"16","author":"I Rutter","year":"2012","unstructured":"Rutter, I., Wolff, A.: Augmenting the connectivity of planar and geometric graphs. J. Graph Algorithms Appl. 16, 599\u2013628 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.ejc.2011.09.002","volume":"33","author":"DC T\u00f3th","year":"2012","unstructured":"T\u00f3th, D.C.: Connectivity augmentation in planar straight line graphs. Eur. J. Combin. 33, 408\u2013425 (2012)","journal-title":"Eur. J. Combin."},{"key":"16_CR20","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1137\/100787507","volume":"25","author":"LA V\u00e9gh","year":"2011","unstructured":"V\u00e9gh, L.A.: Augmenting undirected node-connectivity by one. SIAM J. Discret. Math. 25, 695\u2013718 (2011)","journal-title":"SIAM J. Discret. Math."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T21:30:39Z","timestamp":1568842239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}