Presentation 2009-04-17
An Improved Algorithm for Inserting a Highway in a City Metric Based on Quasiconvex Optimization
Matias KORMAN, Takeshi TOKUYAMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We introduce an improved algorithm to locate a segment highway such that the maximum city distance between a given set of n points is minimized (where the city distance is measured with speed v>1 on a highway and 1 in the underlying metric elsewhere avoiding obstacles). We consider that such highway is built in a complex transportation system with H other highways and obstacles. The algorithm runs in O(n^3H^3(log^2n+log H)) time using O(nH) space improving the previous O(n^4H^4) time and space bound.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) acility location / city metric / computational geometry / optimization problems / algorithms / urban planning
Paper # COMP2009-5
Date of Issue

Conference Information
Committee COMP
Conference Date 2009/4/10(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Improved Algorithm for Inserting a Highway in a City Metric Based on Quasiconvex Optimization
Sub Title (in English)
Keyword(1) acility location
Keyword(2) city metric
Keyword(3) computational geometry
Keyword(4) optimization problems
Keyword(5) algorithms
Keyword(6) urban planning
1st Author's Name Matias KORMAN
1st Author's Affiliation Graduate School of Information Sciences, Tohoku University()
2nd Author's Name Takeshi TOKUYAMA
2nd Author's Affiliation Graduate School of Information Sciences, Tohoku University
Date 2009-04-17
Paper # COMP2009-5
Volume (vol) vol.109
Number (no) 9
Page pp.pp.-
#Pages 7
Date of Issue