Shortest Path Problems

PhD Qualifying Examination


Title: "Shortest Path Problems"

Mr. Jiongxin Jin


Abstract:

Shortest path problems are fundamental problems in computational
geometry. While the most popular cost model is the Euclidean length,
several non-Euclidean cost models have also been studied extensively. In
this survey, we review the problem with different cost models. We cover
one-shot algorithms that compute exact or approximate shortest paths
between a source and a given destination as well as the query versions of
the problem.


Date:     		Monday, 29 September 2008

Time:                   9:30a.m.-11:30a.m.

Venue:                  Room 4480
 			lifts 25-26

Committee Members:      Dr. Siu-Wing Cheng (Supervisor)
 			Dr. Ke Yi (Chairperson)
 			Dr. Sunil Arya
 			Prof. Mordecai Golin


**** ALL are Welcome ****