The 1-center and 1-highway problem

José Miguel Díaz-Báñez, Cozzetti Matias Korman, Pablo Pérez-Lantero, Inmaculada Ventura

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

In this paper we extend the Rectilinear 1-center as follows: Given a set S of n points in the plane, we are interested in locating a facility point f and a rapid transit line (highway) H that together minimize the expression max p ∈ S d H (p,f), where d H (p,f) is the travel time between p and f. A point p ∈ S uses H to reach f if H saves time for p. We solve the problem in O(n 2) or O(nlogn) time, depending on whether or not the highway's length is fixed.

本文言語English
ホスト出版物のタイトルComputational Geometry - XIV Spanish Meeting, EGC 2011, Dedicated to Ferran Hurtado on the Occasion of His 60th Birthday, Revised Selected Papers
ページ155-165
ページ数11
DOI
出版ステータスPublished - 2012 11 30
外部発表はい
イベント14th Spanish Meeting on Computational Geometry - Alcala de Henares, Spain
継続期間: 2011 6 272011 6 30

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
7579 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other14th Spanish Meeting on Computational Geometry
CountrySpain
CityAlcala de Henares
Period11/6/2711/6/30

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「The 1-center and 1-highway problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル