|
|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/9186
|
| タイトル: | Constructing Optimal Highways |
| 著者: | Ahn, Hee-Kap
Alt, Helmut
Asano, Tetsuo
Bae, Sang Won
Brass, Peter
Cheong, Otfried
Knauer, Christian
Na, Hyeon-Suk
Shin, Chan-Su
Wolff, Alexander |
| キーワード: | geometric facility location
min-max-min problem
city metric
time metric
optimal highways |
| 発行日: | 2009 |
| 出版者: | World Scientific Publishing |
| 誌名: | International Journal of Foundations of Computer Science |
| 巻: | 20 |
| 号: | 1 |
| 開始ページ: | 3 |
| 終了ページ: | 23 |
| DOI: | 10.1142/S0129054109006425 |
| 抄録: | For two points p and q in the plane, a straight line h, called a highway, and a real v > 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. 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_1- and the Euclidean metric as the underlying metric. If arbitrary orientations are allowed, then the optimal highway can be computed in O(n^2 log n) time. We also consider the problem of computing an optimal pair of highways, one being horizontal, one vertical. |
| Rights: | Electronic version of an article published as International Journal of Foundations of Computer Science, 20(1), 2009, 3-23. DOI:10.1142/S0129054109006425. Copyright World Scientific Publishing Company, http://dx.doi.org/10.1142/S0129054109006425 |
| URI: | http://hdl.handle.net/10119/9186 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 14487.pdf | | 214Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
