Algorithms Seminar -- Paper Presentations
-
September 19, 1997 -- Paper,
C. D. Bateman, C. H. Helvig, G. Robins, and A. Zelikovsky,
Provably-Good Routing Tree Construction
with Multi-Port Terminals, to be presented by Saurabh Sethia.
-
October 24, 1997 -- Paper,
Progressive simplicial complexes by Popovic
and Hoppe.
Presented by Tsung-Chin Ho.
-
November 7, 1997 --
Paper,
On Local Register Allocation
by Martin Farach and Vincenzo Liberatore.
Presented by Barry Cohen.
-
September 25, 1998 -- Paper presentation by Saurabh Sethia of
Sandor Fekete's paper
Simplicity and Hardness of the Maximum Traveling Salesman
Problem under Geometric Distances