Summary
    Friday, January 5
	8:00-8:50	Continental breakfast
	8:50-9:00	Opening remarks
	9:00-10:30	Contributed talks
	10:30-11:00	Coffee Break
	11:00-12:00	Invited talk
	12:00-2:00	Lunch break
	2:00-3:30	Contributed talks
	3:30-4:00	Coffee Break
	4:00-5:30	Contributed talks
	6:00-		Business meeting
    Saturday, January 6
	8:15-9:00	Continental breakfast
	9:00-10:00	Invited talk
	10:00-10:30	Coffee Break
	10:30-12:00	Contributed talks
	12:00-2:00	Lunch break
	2:00-3:00	Invited talk
	3:00-3:30	Coffee Break
	3:30-5:00	Contributed talks
	5:00		Workshop adjourns

Friday, January 5

OPENING REMARKS, 8:50-9:00

Session 1, 9:00-10:30
Chair:  Matt Stallmann

9:00-9:30 Solving a ``Hard'' Problem to Approximate an ``Easy'' One:
	Heuristics for Maximum Matchings and Maximum Traveling
	Salesman Problems
	Sandor P. Fekete, Henk Meijer, Andre Rohe, and Walter Tietze

9:30-10:00 CNOP - A Package for Constrained Network Optimization
	Kurt Mehlhorn and Mark Ziegelmann

10:00-10:30 The Asymmetric Traveling Salesman Problem:
	Algorithms, Instance Generators, and Tests
	J. Cirasella, D. S. Johnson, L. A. McGeoch, and W. Zhang

Session 2, Invited talk, 11:00-12:00
Chair:  Adam Buchsbaum

Network tomography through end-to-end measurements
Prof. Donald Towsley, U. Mass., Amherst

Session 3, 2:00-3:30
Chair:  Lyle McGeoch

2:00-2:30 Experimental results on statistical approaches to page
	 replacement policies
	Vitus Leung and Sandy Irani

2:30-3:00 Estimating Resemblance of MIDI documents
	Michael Mitzenmacher and Sean Owen

3:00-3:30 Experiments on Adaptive Set Intersections for Text
	Retrieval Systems
	Erik D. Demaine, Alejandro Lopez-Ortiz, and J. Ian Munro

Session 4, 4:00-5:30
Chair:  Jack Snoeyink

4:00-4:30 PVD: A Stable Implementation for Computing Voronoi
	Diagrams of Polygonal Pockets
	Saurabh Sethia, Martin Held, and Joseph S. B. Mitchell

4:30-5:00 Hierarchical Clustering of Trees: Algorithms and Experiments
	I. Finocchi and R. Petreschi

5:00-5:30 Travel Planning With Non-Cartographic Maps
	Ulrik Brandes, Frank Schulz, Dorothea Wagner, and Thomas Willhalm

BUSINESS MEETING, 6:00-
	Refreshments will be served

Saturday, January 6

Session 5, Invited talk, 9:00-10:00
Chair:  S. Muthukrishnan

New algorithmic challenges arising in measurement-driven networking research
Dr. Walter Willinger, AT&T Labs--Research

Session 6, 10:30-12:00
Chair:  Lyle McGeoch

10:30-11:00 A Probabilistic Spell for the Curse of Dimensionality
	Edgar Chavez and Gonzalo Navarro

11:00-11:30 Experimental Evaluation of the Height of a Random Set
	of Points in a d-Dimensional Cube
	E. Breimer, M. Goldberg, B. Kolstad, and M. Magdon-Ismail 

11:30-12:00 An Empirical Study of a New Approach to Nearest
	Neighbor Searching
	S. Maneewongvatana and D. M. Mount

Session 7, Invited talk, 2:00-3:00
Chair:  Jack Snoeyink

Spectral analysis for data mining
Prof. Anna Karlin, U. Washington

Session 8, 3:30-5:00
Chair:  Adam Buchsbaum

3:30-4:00 Trade off Between Compression and Search Times in
	Compact Suffix Array
	Veli Mäkinen

4:00-4:30 Implementation of a PTAS for Scheduling with Release Dates
	Clint Hepner and Cliff Stein

4:30-5:00 Biased skip lists for highly skewed access patterns
	Funda Ergun, S. Cenk Sahinalp, Jon Sharp, and Rakesh K. Sinha