{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:32:11Z","timestamp":1759667531227},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_60","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"611-620","source":"Crossref","is-referenced-by-count":8,"title":["Optimal Insertion of a Segment Highway in a City Metric"],"prefix":"10.1007","author":[{"given":"Matias","family":"Korman","sequence":"first","affiliation":[]},{"given":"Takeshi","family":"Tokuyama","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"60_CR1","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., del R\u00edo, B.P., Sacristan, V.: Proximity Problems for Time Metrics Induced by the L\n                  1 Metric and Isothetic Networks. In: Proc. Encuentros en Geometr\u00eda Computacional (2001)"},{"key":"60_CR2","unstructured":"Ahn, H.-K., Alt, H., Asano, T., Bae, S.W., Brass, P., Cheong, O., Knauer, C., Na, H.-S., Shin, C.-S., Wolff, A.: Constructing Optimal Highways. In: Computing: The Australian Theory Symposium, vol.\u00a065 (2007)"},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"Aicholzer, O., Aurenhammer, F., Palop, B.: Quickest Path, Straight Skeleton and the City Voronoi Diagram. In: ACM Sympos. Comput. Geom., pp. 151\u2013159 (2002)","DOI":"10.1145\/513400.513420"},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"Bae, S.W., Kim, J.-H., Chwa, K.-Y.: Optimal Construction of the City Voronoi Diagram. In: Proc. 17th Annu. Internat. Sympos. Algorithms Comput., pp. 183\u2013192 (2006)","DOI":"10.1007\/11940128_20"},{"key":"60_CR5","doi-asserted-by":"crossref","unstructured":"Bae, S.W., Chua, K.-Y.: Shortest Paths and Voronoi Diagrams with Transportation Networks under General Distances. In: Proc 16th Annu. Internat. Sympos. Algoritms Comput., pp. 1007\u20131018 (2005)","DOI":"10.1007\/11602613_100"},{"key":"60_CR6","series-title":"Algorithms and Applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry. Algorithms and Applications. Springer, Heidelberg (1997)"},{"key":"60_CR7","unstructured":"Cardinal, J., Langerman, S.: Min-max-min Geometric Facility Location Problems. In: Proc. of the European Workshop on Computational Geometry (2006)"},{"key":"60_CR8","first-page":"0705","volume":"arXiv","author":"J. Cardinal","year":"2007","unstructured":"Cardinal, J., Collette, S., Hurtado, F., Langerman, S., Palop, B.: Moving Walkways, Escalators, and Elevators. Eprint arXiv:0705.0635 (2007)","journal-title":"Eprint"},{"issue":"1","key":"60_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0166-218X(91)90011-K","volume":"30","author":"R. Hassin","year":"1991","unstructured":"Hassin, R., Megiddo, N.: Approximation Algorithms for Hitting Objects with Straight Lines. Discrete Applied Mathematics\u00a030(1), 29\u201342 (1991)","journal-title":"Discrete Applied Mathematics"},{"key":"60_CR10","doi-asserted-by":"crossref","unstructured":"Korman, M., Tokuyama, T.: Optimal Insertion of a Segment Highway in a City Metric. In: Proc. of the European Workshop on Computational Geometry, pp. 189\u2013192 (2008)","DOI":"10.1007\/978-3-540-69733-6_60"},{"key":"60_CR11","first-page":"177","volume":"38","author":"E. Kranakis","year":"1994","unstructured":"Kranakis, E., Krizanc, D., Meertens, L.: Link Length of Rectilinear Hamiltonian Tours in Grids. Ars Combinatoria\u00a038, 177\u2013192 (1994)","journal-title":"Ars Combinatoria"},{"issue":"3","key":"60_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218195996000216","volume":"6","author":"J.S.B. Mitchell","year":"1996","unstructured":"Mitchell, J.S.B.: L\n                  1 Shortest Paths among Obstacles in the Plane. Internat. J. Comput. Geom. Appl.\u00a06(3), 309\u2013331 (1996)","journal-title":"Internat. J. Comput. Geom. Appl."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:44:58Z","timestamp":1620017098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}