{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T09:24:34Z","timestamp":1648718674337},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,12,27]],"date-time":"2016-12-27T00:00:00Z","timestamp":1482796800000},"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":["Algorithmica"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s00453-016-0263-3","type":"journal-article","created":{"date-parts":[[2016,12,27]],"date-time":"2016-12-27T15:40:52Z","timestamp":1482853252000},"page":"448-471","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Geometric Path Problems with Violations"],"prefix":"10.1007","volume":"80","author":[{"given":"Anil","family":"Maheshwari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Drimit","family":"Pattanayak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sasanka","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,27]]},"reference":[{"issue":"12","key":"263_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0166-218X(90)90124-U","volume":"27","author":"A Aggarwal","year":"1990","unstructured":"Aggarwal, A., Klawe, M.: Applications of generalized matrix searching to geometric algorithms. Discrete Appl. Math. 27(12), 3\u201323 (1990)","journal-title":"Discrete Appl. Math."},{"key":"263_CR2","unstructured":"Bint, G., Maheshwari, A., Smid, M.H.M.: xy-monotone path existence queries in a rectilinear environment. In: Proceedings of CCCG, pp. 35\u201340 (2012)"},{"key":"263_CR3","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1137\/S0097539703439404","volume":"34","author":"T Chan","year":"2005","unstructured":"Chan, T.: Low-dimensional linear programming with violations. SIAM J. Comput. 34, 879\u2013893 (2005)","journal-title":"SIAM J. Comput."},{"key":"263_CR4","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6, 485\u2013524 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"263_CR5","doi-asserted-by":"crossref","unstructured":"De Carufel, J.-L., Grimm, C., Maheshwari, A., Smid, M.: Minimizing the continuous diameter when augmenting paths and cycles with shortcuts. In: 15th Scandinavian Symposium and Workshop on Algorithmic Theory, Reykjavik, Iceland, June (2016)","DOI":"10.1007\/978-3-319-62127-2_26"},{"key":"263_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02187714","volume":"4","author":"PJ Rezende de","year":"1989","unstructured":"de Rezende, P.J., Lee, D.T., Wu, Y.F.: Rectilinear shortest paths in the presence of rectangular barriers. Discrete Comput. Geom. 4, 41\u201353 (1989)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"263_CR7","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/050635675","volume":"38","author":"M Farshi","year":"2008","unstructured":"Farshi, M., Giannopoulos, P., Gudmundsson, J.: Improving the stretch factor of a geometric network by edge augmentation. SIAM J. Comput. 38(1), 226\u2013240 (2008)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"263_CR8","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"263_CR9","doi-asserted-by":"crossref","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":"263_CR10","doi-asserted-by":"crossref","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."},{"key":"263_CR11","doi-asserted-by":"crossref","unstructured":"Gro\u00dfe, U., Gudmundsson, J., Knauer, C., Smid, M., Stehn, F.: Fast algorithms for diameter-optimally augmenting paths. In: 42nd ICALP, LNCS, vol. 9134, pp. 678\u2013688, Kyoto, Japan, July (2015)","DOI":"10.1007\/978-3-662-47672-7_55"},{"key":"263_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"LJ Guibas","year":"1987","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithm for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"key":"263_CR13","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"LJ Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygons. J. Comput. Syst. Sci. 39, 126\u2013152 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"263_CR14","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 the minimum length path in a given homotopy class. Comput. Geom. Theory Appl. 4, 63\u201397 (1994)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"6","key":"263_CR15","doi-asserted-by":"crossref","first-page":"1612","DOI":"10.1137\/S0097539793253577","volume":"26","author":"J Hershberger","year":"1997","unstructured":"Hershberger, J., Suri, S.: Matrix searching with the shortest-path metric. SIAM J. Comput. 26(6), 1612\u20131634 (1997)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"263_CR16","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"DG Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G.: Optimal search in planar subdivisions. SIAM J. Comput. 12(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"263_CR17","doi-asserted-by":"crossref","unstructured":"Levcopoulos, C.: Fast heuristics for minimum length rectangular partitions of polygons. In: Symposium on Computational Geometry, pp. 100\u2013108 (1986)","DOI":"10.1145\/10515.10526"},{"key":"263_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-2256-2","volume-title":"Euclidean Shortest Paths\u2014Exact or Approximate Algorithms","author":"F Li","year":"2011","unstructured":"Li, F., Klette, R.: Euclidean Shortest Paths\u2014Exact or Approximate Algorithms. Springer, Berlin (2011)"},{"key":"263_CR19","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02570713","volume":"14","author":"J Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: On geometric optimization with few violated constraints. Discrete Comput. Geom. 14, 365\u2013384 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"263_CR20","volume-title":"Geometric shortest paths and network optimization. Handbook of computational geometry","author":"JSB Mitchell","year":"1998","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. Handbook of computational geometry. Elsevier Science Publishers B.V., North-Holland (1998)"},{"issue":"2","key":"263_CR21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(94)00134-0","volume":"52","author":"T Ross","year":"1994","unstructured":"Ross, T., Widemayer, P.: $$k$$ k -violation linear programming. Inf. Process. Lett. 52(2), 109\u2013114 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"263_CR22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1142\/S0218195996000149","volume":"6","author":"S Schuierer","year":"1996","unstructured":"Schuierer, S.: An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon. Int. J. Comput. Geom. Appl. 6(2), 205\u2013226 (1996)","journal-title":"Int. J. Comput. Geom. Appl."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0263-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0263-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0263-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T00:30:35Z","timestamp":1568680235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0263-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,27]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["263"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0263-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,27]]}}}