Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

COMGEO
2004
ACM

favoriteEmaildiscussreport

145views Applied Computing» more COMGEO 2004»

Approximating geometric bottleneck shortest paths

13 years 4 months ago

Approximating geometric bottleneck shortest paths

Download users.cs.fiu.edu

Prosenjit Bose, Anil Maheshwari, Giri Narasimhan,

Real-time Traffic

Applied Computing | COMGEO 2004 |

claim paper

Related Content

» Shortest Path Queries Between Geometric Objects on Surfaces

» Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces

» 1link shortest paths in weighted regions

» On Bounded Leg Shortest Paths Problems

» Competitive Online Routing in Geometric Graphs

» Sublinear geometric algorithms

» Spanners for Geometric Intersection Graphs

» Algorithms for Computing QoS Paths with Restoration

» Design and Analysis of Computer Algorithms

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	COMGEO
Authors	Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh

Comments (0)