{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:40:31Z","timestamp":1726062031890},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030364113"},{"type":"electronic","value":"9783030364120"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-36412-0_14","type":"book-chapter","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:04:15Z","timestamp":1575590655000},"page":"168-180","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Shortest Paths in Polygons with Violations"],"prefix":"10.1007","author":[{"given":"Binayak","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sasanka","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,23]]},"reference":[{"key":"14_CR1","unstructured":"Agarwal, P.K., Kumar, N., Sintos, S., Suri, S.: Computing shortest paths in the plane with removable obstacles. In: 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BFb0054351","volume-title":"Algorithm Theory \u2014 SWAT\u201998","author":"L Aleksandrov","year":"1998","unstructured":"Aleksandrov, L., Lanthier, M., Maheshwari, A., Sack, J.-R.: An $$\\varepsilon $$\u2014approximation algorithm for weighted shortest paths on polyhedral surfaces. In: Arnborg, S., Ivansson, L. (eds.) SWAT 1998. LNCS, vol. 1432, pp. 11\u201322. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0054351"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Asano, T., Asano, T., Guibas, L., Hershberger, J., Imai, H.: Visibility-polygon search and Euclidean shortest paths. In: 26th Annual Symposium on Foundations of Computer Science, pp. 155\u2013164. IEEE (1985)","DOI":"10.1109\/SFCS.1985.65"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1137\/06067777X","volume":"38","author":"SW Cheng","year":"2008","unstructured":"Cheng, S.W., Na, H.S., Vigneron, A., Wang, Y.: Approximate shortest paths in anisotropic regions. SIAM J. Comput. 38(3), 802\u2013824 (2008)","journal-title":"SIAM J. Comput."},{"key":"14_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"SK Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, Cambridge (2007)"},{"issue":"5","key":"14_CR6","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1137\/0220055","volume":"20","author":"SK Ghosh","year":"1991","unstructured":"Ghosh, S.K., Mount, D.M.: An output-sensitive algorithm for computing visibility graphs. SIAM J. Comput. 20(5), 888\u2013910 (1991)","journal-title":"SIAM J. Comput."},{"issue":"1\u20134","key":"14_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L Guibas","year":"1987","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2(1\u20134), 209\u2013233 (1987)","journal-title":"Algorithmica"},{"key":"14_CR8","unstructured":"Hershberger, J., Kumar, N., Suri, S.: Shortest paths in the plane with obstacle violations. In: 25th Annual European Symposium on Algorithms (ESA 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0925-7721(97)00004-7","volume":"10","author":"J Hershberger","year":"1998","unstructured":"Hershberger, J., Suri, S.: Practical methods for approximating shortest paths on a convex polytope in $$\\cal{R}^3$$. Comput. Geom. 10(1), 31\u201346 (1998)","journal-title":"Comput. Geom."},{"issue":"6","key":"14_CR10","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.1137\/S0097539795289604","volume":"28","author":"J Hershberger","year":"1999","unstructured":"Hershberger, J., Suri, S.: An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Comput. 28(6), 2215\u20132256 (1999)","journal-title":"SIAM J. Comput."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Kapoor, S., Maheshwari, S.: Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles. In: Proceedings of the Fourth Annual Symposium on Computational Geometry, pp. 172\u2013182. ACM (1988)","DOI":"10.1145\/73393.73411"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Lanthier, M., Maheshwari, A., Sack, J.R.: Approximating weighted shortest paths on polyhedral surfaces. In: Proceedings of the Thirteenth Annual Symposium on Computational Geometry, pp. 274\u2013283. ACM (1997)","DOI":"10.1145\/262839.262984"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-1-4471-2256-2_1","volume-title":"Euclidean Shortest Paths","author":"F Li","year":"2011","unstructured":"Li, F., Klette, R.: Euclidean shortest paths. In: Li, F., Klette, R. (eds.) Euclidean Shortest Paths, pp. 3\u201329. Springer, London (2011). \nhttps:\/\/doi.org\/10.1007\/978-1-4471-2256-2_1"},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/s00453-016-0263-3","volume":"80","author":"A Maheshwari","year":"2018","unstructured":"Maheshwari, A., Nandy, S.C., Pattanayak, D., Roy, S., Smid, M.: Geometric path problems with violations. Algorithmica 80(2), 448\u2013471 (2018)","journal-title":"Algorithmica"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01530888","volume":"3","author":"JS Mitchell","year":"1991","unstructured":"Mitchell, J.S.: A new algorithm for shortest paths among obstacles in the plane. Ann. Math. Artif. Intell. 3(1), 83\u2013105 (1991)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"03","key":"14_CR16","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218195996000216","volume":"6","author":"JS Mitchell","year":"1996","unstructured":"Mitchell, J.S.: Shortest paths among obstacles in the plane. Int. J. Comput. Geom. Appl. 6(03), 309\u2013332 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume-title":"Handbook of Computational Geometry","author":"Joseph S.B. Mitchell","year":"2000","unstructured":"Mitchell, J.S.: Geometric shortest paths and network optimization. In: Handbook of Computational Geometry, vol. 334, pp. 633\u2013702 (2000)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Overmars, M.H., Welzl, E.: New methods for computing visibility graphs. In: Proceedings of the Fourth Annual Symposium on Computational Geometry, pp. 164\u2013171. ACM (1988)","DOI":"10.1145\/73393.73410"},{"issue":"2","key":"14_CR19","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0020-0190(86)90045-1","volume":"23","author":"H Rohnert","year":"1986","unstructured":"Rohnert, H.: Shortest paths in the plane with convex polygonal obstacles. Inf. Process. Lett. 23(2), 71\u201376 (1986)","journal-title":"Inf. Process. Lett."},{"key":"14_CR20","unstructured":"Roy, S., Lodha, S., Das, S., Maheswari, A.: Approximate shortest descent path on a terrain (2007)"},{"key":"14_CR21","unstructured":"Snoeyink, J.H.J.: Computing minimum length paths of a given homotopy class. In: Computational Geometry: Theory and Applications. Citeseer (1990)"},{"issue":"5","key":"14_CR22","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1145\/185675.185795","volume":"41","author":"JA Storer","year":"1994","unstructured":"Storer, J.A., Reif, J.H.: Shortest paths in the plane with polygonal obstacles. J. ACM (JACM) 41(5), 982\u20131012 (1994)","journal-title":"J. ACM (JACM)"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-45678-3_15","volume-title":"Algorithms and Computation","author":"Z Sun","year":"2001","unstructured":"Sun, Z., Reif, J.: BUSHWHACK: an approximation algorithm for minimal paths through pseudo-Euclidean spaces. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 160\u2013171. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45678-3_15"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36412-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:10:09Z","timestamp":1575591009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36412-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030364113","9783030364120"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36412-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xiamen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoaconference.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"108","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}