Dartmouth CS, Nov. 11: Philip Klein (Brown University)

Thread View: ne.seminars

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by David Kotz Fri, 06 Nov 1992 14:30

#48

Author: David Kotz
Date: Fri, 06 Nov 1992 14:30

37 lines
1904 bytes

                           Dartmouth College
                       Computer Science Colloqium

                             Philip Klein
                           Brown University 

	   Parallel and Dynamic Approximation Schemes for Shortest Paths
                           in Planar Networks

                           Wednesday, 4:00 PM
                           102 Bradley Hall

         Refreshments at 3:30pm in Faculty Lounge, 2nd floor



						 ABSTRACT

Single-source shortest paths is a notoriously difficult problem to
parallelize efficiently.  We give the first efficient parallel
approximation scheme for shortest paths in planar networks.  Our
techniques also yield methods for maintaining approximate shortest
paths and Steiner trees in planar networks under dynamic edge-deletion
and addition.

	   		 	    		  		Joint work with S. Sairam.

For additional info please contact David Kotz at David.Kotz@dartmouth.edu.

Directions to Bradley Hall:
	   anonymous ftp to sunapee.dartmouth.edu in pub/directions
-- 
-----------------
Mathematics and Computer Science
Dartmouth College, 6188 Bradley Hall, Hanover NH 03755-3551
email: David.Kotz@Dartmouth.edu    or   dfk@cs.dartmouth.edu

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads