Approximating Geometric Bottleneck Shortest Paths
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Approximating geometric bottleneck shortest paths
Computational Geometry: Theory and Applications
Voronoi-like partition of lattice in cellular automata
Mathematical and Computer Modelling: An International Journal
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem
Computational Geometry: Theory and Applications
Hi-index | 0.89 |