CONSTRUCTING OPTIMAL HIGHWAYS
From MaRDI portal
Publication:3620612
DOI10.1142/S0129054109006425zbMath1171.90443MaRDI QIDQ3620612
Sang Won Bae, Hyeon-Suk Na, Hee-Kap Ahn, Helmut Alt, Alexander Wolff, Chan-Su Shin, Christian Knauer, Peter Brass, Tetsuo Asano, Otfried Schwarzkopf
Publication date: 14 April 2009
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Minimax problems in mathematical programming (90C47) Discrete location and assignment (90B80) Distance in graphs (05C12)
Related Items
Proximity graphs inside large weighted graphs, Weber problems with high-speed lines, Locating a Service Facility and a Rapid Transit Line, The 1-Center and 1-Highway Problem, Optimal location of transportation devices, The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited, The 1-median and 1-highway problem, Bichromatic 2-center of pairs of points, All Farthest Neighbors in the Presence of Highways and Obstacles
Cites Work
- Unnamed Item
- The upper envelope of piecewise linear functions: Algorithms and applications
- Voronoi diagram for services neighboring a highway
- Quickest paths, straight skeletons, and the city Voronoi diagram
- Geometric applications of a randomized optimization technique
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem
- Generalized Selection and Ranking: Sorted Matrices
- VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE
- Euclidean Constructibility in Graph-Minimization Problems
