Sciweavers

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

9

COMPGEOM
1990
ACM

favoriteEmaildiscussreport

71views Discrete Geometry» more COMPGEOM 1990»

On Solving Geometric Optimization Problems Using Shortest Paths

13 years 9 months ago

On Solving Geometric Optimization Problems Using Shortest Paths

Download www.cs.tufts.edu

Elefterios A. Melissaratos, Diane L. Souvaine

Real-time Traffic

COMPGEOM 1990 | Discrete Geometry |

claim paper

Related Content

» DIJKSTRAS and Fast Marching Method for Optimal Path Planning

» A new approach for shortest path routing problem by random keybased GA

» Solving path problems on the GPU

» A Lower Bound for the Shortest Path Problem

» Solving Shortest Capacitated Path Problem Using a BiObjective Heuristic Approach

» Program generation for the allpairs shortest path problem

» 1link shortest paths in weighted regions

» Computing shortest paths for any number of hops

» A new approach to dynamic all pairs shortest paths

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1990
Where	COMPGEOM
Authors	Elefterios A. Melissaratos, Diane L. Souvaine

Comments (0)