The transportation metric and related problems

Authors:
Yaron Ostrovsky-Berman
Affiliations:
School of Engineering and Computer Science, The Hebrew University of Jerusalem, Jerusalem 91904, Israel
Venue:
Information Processing Letters
Year:
2005

Citing 5
Cited 2

The discrete geodesic problem

SIAM Journal on Computing
The weighted region problem: finding shortest paths through a weighted planar subdivision

Journal of the ACM (JACM)
An Optimal Algorithm for Euclidean Shortest Paths in the Plane

SIAM Journal on Computing
Quickest paths, straight skeletons, and the city Voronoi diagram

Proceedings of the eighteenth annual symposium on Computational geometry
Voronoi Diagram for services neighboring a highway

Information Processing Letters

All Farthest Neighbors in the Presence of Highways and Obstacles

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Proximity graphs inside large weighted graphs

Networks

Quantified Score

Hi-index	0.89

Visualization

Abstract