Approximating geometric bottleneck shortest paths

Prosenjit K. Bose, Anil Maheshwari, Giri Narasimhan, Michiel Smid, and Norbert Zeh
Proc. 20th Symp. Theoretical Aspects of Computer Science (STACS 2003), Lecture Notes in Computer Science 2607, Helmut Alt and Michel Habib, ed., Springer-Verlag, 2003, pp. 38–49
http://www.scs.carleton.ca/~michiel/airport.ps.gz

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!