{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:58:15Z","timestamp":1649033895579},"reference-count":15,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2008,11]]},"DOI":"10.1016\/j.orl.2008.06.008","type":"journal-article","created":{"date-parts":[[2008,7,19]],"date-time":"2008-07-19T04:37:29Z","timestamp":1216442249000},"page":"684-687","source":"Crossref","is-referenced-by-count":2,"title":["Computing shortest heterochromatic monotone routes"],"prefix":"10.1016","volume":"36","author":[{"given":"J.M.","family":"D\u00edaz-B\u00e1\u00f1ez","sequence":"first","affiliation":[]},{"given":"G.","family":"Hern\u00e1ndez","sequence":"additional","affiliation":[]},{"given":"D.","family":"Oliveros","sequence":"additional","affiliation":[]},{"given":"A.","family":"Ram\u00edrez-Vigueras","sequence":"additional","affiliation":[]},{"given":"J.A.","family":"Sellar\u00e8s","sequence":"additional","affiliation":[]},{"given":"J.","family":"Urrutia","sequence":"additional","affiliation":[]},{"given":"I.","family":"Ventura","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2008.06.008_b1","doi-asserted-by":"crossref","unstructured":"E.M. Arkin, R. Connelly, J.S. Mitchell, On monotone paths among obstacles with applications to planning assemblies, in: Proceedings of the Fifth Annual Symposium on Computational Geometry, Saarbruchen, West Germany, 1989, pp. 334\u2013343","DOI":"10.1145\/73833.73870"},{"key":"10.1016\/j.orl.2008.06.008_b2","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1137\/0221057","article-title":"New results on dynamic planar point location","volume":"21","author":"Cheng","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.orl.2008.06.008_b3","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.jalgor.2005.01.010","article-title":"TSP with neighborhoods of varying size","volume":"57","author":"de Berg","year":"2005","journal-title":"J. Algorithms"},{"key":"10.1016\/j.orl.2008.06.008_b4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1287\/ijoc.12.4.317.11880","article-title":"Approximation of point sets by 1-corner polygonal chains","volume":"12","author":"D\u00edaz-B\u00e1\u00f1ez","year":"2000","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.orl.2008.06.008_b5","doi-asserted-by":"crossref","unstructured":"K. Elbassioni, A.V. Fishkin, N.H. Mustafa, R. Sitters, Approximation algorithms for Euclidean group TSP, in: Proc. 32nd Internat. Colloq. Automata Lang. Prog., 2005, pp. 1115\u20131126","DOI":"10.1007\/11523468_90"},{"key":"10.1016\/j.orl.2008.06.008_b6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","article-title":"A sweepline algorithm for Voronoi diagrams","volume":"2","author":"Fortune","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/j.orl.2008.06.008_b7","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979"},{"issue":"2","key":"10.1016\/j.orl.2008.06.008_b8","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1137\/S0097539793254376","article-title":"Dynamic trees and dynamic point location","volume":"28","author":"Goodrich","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.orl.2008.06.008_b9","doi-asserted-by":"crossref","unstructured":"F. Li, D. Cheng, M. Hadjieleftheriou, G. Kollios, S.H. Teng, On trip planning queries in spatial databases, in: Proc. of the 9th International Symposium on Spatial and Temporal Databases, SSTD05, 2005, pp. 273\u2013290","DOI":"10.1007\/11535331_16"},{"key":"10.1016\/j.orl.2008.06.008_b10","series-title":"Handbook of Discrete and Computational Geometry","first-page":"445","article-title":"Shortest paths and networks","author":"Mitchell","year":"1997"},{"key":"10.1016\/j.orl.2008.06.008_b11","unstructured":"J.S.B. Mitchell, A PTAS for TSP with neighborhoods among fat regions in the plane, in: Proc. ACM\u2013SIAM Symp. Discrete Algorithms, SODA 2007, pp. 11\u201318"},{"key":"10.1016\/j.orl.2008.06.008_b12","series-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","author":"Okabe","year":"1992"},{"key":"10.1016\/j.orl.2008.06.008_b13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","article-title":"The euclidean traveling salesman problem is NP-complete","volume":"4","author":"Papadimitriou","year":"1977","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.orl.2008.06.008_b14","unstructured":"P. Slav\u00edk, The errand scheduling problem, Technical Report, March 14 1997. Technical Report, SUNY, Buffalo, USA"},{"key":"10.1016\/j.orl.2008.06.008_b15","unstructured":"Y. Yan, D. Lemire, M. Brooks, Monotone pieces analysis for qualitative modeling, in: Proceedings ECAI 2004 MONET Workshop on Model-Based System, Valencia, Spain, 2004"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167637708000862?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167637708000862?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T16:00:20Z","timestamp":1557676820000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637708000862"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["S0167637708000862"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.orl.2008.06.008","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2008,11]]}}}