{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:31:52Z","timestamp":1771036312394,"version":"3.50.1"},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2009,2]]},"abstract":"<jats:p> For two points p and q in the plane, a straight line h, called a highway, and a real v &gt; 1, we define the travel time (also known as the city distance) from p and q to be the time needed to traverse a quickest path from p to q, where the distance is measured with speed v on h and with speed 1 in the underlying metric elsewhere. <\/jats:p><jats:p> Given a set S of n points in the plane and a highway speed v, we consider the problem of finding a highway that minimizes the maximum travel time over all pairs of points in S. If the orientation of the highway is fixed, the optimal highway can be computed in linear time, both for the L<jats:sub>1<\/jats:sub>- and the Euclidean metric as the underlying metric. If arbitrary orientations are allowed, then the optimal highway can be computed in O(n<jats:sup>2<\/jats:sup> log n) time. We also consider the problem of computing an optimal pair of highways, one being horizontal, one vertical. <\/jats:p>","DOI":"10.1142\/s0129054109006425","type":"journal-article","created":{"date-parts":[[2009,2,17]],"date-time":"2009-02-17T10:16:23Z","timestamp":1234865783000},"page":"3-23","source":"Crossref","is-referenced-by-count":8,"title":["CONSTRUCTING OPTIMAL HIGHWAYS"],"prefix":"10.1142","volume":"20","author":[{"given":"HEE-KAP","family":"AHN","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, POSTECH, Pohang, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HELMUT","family":"ALT","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Freie Universit\u00e4t Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TETSUO","family":"ASANO","sequence":"additional","affiliation":[{"name":"School of Information Science, Japan Advanced Institute of Science and Technology, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SANG WON","family":"BAE","sequence":"additional","affiliation":[{"name":"Division of Computer Science, Korea Advanced Institute of Science and Technology, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PETER","family":"BRASS","sequence":"additional","affiliation":[{"name":"Department of Computer Science, City College of New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"OTFRIED","family":"CHEONG","sequence":"additional","affiliation":[{"name":"Division of Computer Science, Korea Advanced Institute of Science and Technology, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CHRISTIAN","family":"KNAUER","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Freie Universit\u00e4t Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HYEON-SUK","family":"NA","sequence":"additional","affiliation":[{"name":"School of Computing, Soongsil University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CHAN-SU","family":"SHIN","sequence":"additional","affiliation":[{"name":"School of Electrical and Information Engineering, Hankuk University of Foreign Studies, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALEXANDER","family":"WOLFF","sequence":"additional","affiliation":[{"name":"Faculteit Wiskunde en Informatica, TU Eindhoven, Eindhoven, the Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"rf1","unstructured":"M.\u00a0Abellanas, Actas de los IX Encuentros de Geometr\u00eda Computacional (Girona, 2001)\u00a0pp. 175\u2013182."},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00505-7"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-003-2947-0"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195906001963"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(02)00102-5"},{"key":"rf9","volume-title":"Actas de los XII Encuentros de Geometr\u00eda Computacional","author":"Cardinal J.","year":"2007"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009478"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.2307\/2688541"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187733"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1137\/0213002"},{"key":"rf15","author":"G\u00f6rke R.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"rf16","volume-title":"Davenport-Schinzel Sequences and Their Geometric Applications","author":"Sharir M.","year":"1995"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054109006425","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:39:18Z","timestamp":1565095158000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054109006425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2]]},"references-count":12,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2009,2]]}},"alternative-id":["10.1142\/S0129054109006425"],"URL":"https:\/\/doi.org\/10.1142\/s0129054109006425","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2]]}}}