Workshop Program: DIMACS Workshop on Geometric Optimization

Tue Apr 8 14:06:05 PDT 2003

[Note: please register as soon as possible if you plan to
attend any or all of the 3-day workshop -- this will help us
in planning how many people to expect (and how much food to order!).
See registration information and links at the bottom of this email.
Thanks!    --Joe]

----------------------------------------------------------
DIMACS Workshop on Geometric Optimization

May 19 - 21, 2003
DIMACS Center, CoRE Building, Rutgers University

Organizers: 
     Pankaj Agarwal, Duke University, pankaj at cs.duke.edu 
     Joe Mitchell, SUNY Stony Brook, jsbm at ams.sunysb.edu 

Presented under the auspices of the Special Focus on
Computational Geometry and Applications.
----------------------------------------------------------

Workshop Program:

MONDAY May 19

08:15-08:55	Breakfast and registration

08:55-09:00	Opening remarks
             	Fred Roberts, Director of DIMACS

09:00-10:00	Unique Sink Orientations of Cubes and its Relations 
		to Optimization
		Emo Welzl, ETH Zurich

10:00-10:30	Smoothed Analysis of Algorithms: Simplex Algorithm 
		and Numerical Analysis
		Shanghua Teng, Boston University

10:30-11:00	Break

11:00-11:30 	The Protein Side-Chain Positioning Problem
		Carl Kingsford, Princeton University

11:30-12:00	Approximate Protein Structural Alignment in Polynomial Time
		Rachel Kolodny, Stanford University

12:00-12:30	Hausdorff Distance under Translation for Points and Balls
		Yusu Wang, Duke University

12:30-02:00	Lunch

02:00-03:00	Emerging Trends in Optimization
		Dan Bienstock, Columbia University

03:00-03:30	Exact Parallel Algorithm for Computing Maximum Feasible
                Subsystems of Linear Relations
		Vera Rosta, McGill University

03:30-04:00	Improved Embeddings of Metrics into Trees
		Satish Rao, UC Berkeley

04:00-04:30	Break

04:30-05:00	Online Searching with Turn Cost
		Erik Demaine, MIT

05:00-05:30	Leave no Stones Unturned: Improved Approximation 
		Algorithms for Degree-Bounded Minimum Spanning Trees
		Raja Jothi, UT Dallas

05:30-06:00 	Constructing Spanners of Different Flavors
		Joachim Gudmundsson

TUESDAY May 20

08:15-09:00	Breakfast and registration

09:00-10:00	Random Walks and Geometric Algorithms
		Santosh Vempala, MIT

10:00-10:30	Approximation Algorithms for k-Center Clustering
		Piyush Kumar, SUNY Sony Brook

10:30-11:00	Break

11:00-11:30	Computing Projective Clusters via Certificates
		Cecilia M. Procopiuc, AT&T Labs

11:30-12:00	Shape Fitting with Outliers
		Sariel Har-Peled, UIUC

12:00-12:30	Approximate Minimum Volume Enclosing Ellipsoids 
		Using Core Sets
		Alper Yildirim, SUNY Sony Brook

12:30-02:00	Lunch

02:00-03:00	Geometric Optimization and Arrangements
		Micha Sharir, Tel Aviv University

03:00-03:30	Approximating the k-Radius of High-Dimensional Point Sets
		Kasturi Varadarajan, University of Iowa

03:30-04:00	Break

04:00-05:00	Approximation Schemes for Geometric NP-Hard Problems: 
		A Survey
		Sanjeev Arora, Princeton University

05:00-05:30	TSP with Neighborhoods of Varying Size
		Matya Katz, Ben Gurion University

05:30-06:00	Touring a Sequence of Polygons
		Alon Efrat, University of Arizona

WEDNESDAY May 21

09:00-10:00	Quasiconvex Programming
		David Eppstein, UC Irvine

10:00-10:30	Engineering Geometric Optimization Algorithms: 
		Some Experiments
		Herve Bronnimann, Polytechnic University

10:30-11:00	Subtraction in Geometric Searching
		Bernard Chazelle

11:00-11:30	Minimum Separation in Weighted Subdivisions
		Ovidiu Daescu and James Palmer

11:30-12:30	Lunch

12:30-01:00	Some Data Streaming Problems in Computational Geometry
		S. Muthukrishnan, Rutgers University

01:00-01:30	Streaming Geometric Optimization Using Graphics Hardware
		Suresh Venkatasubramanian, AT&T Labs

01:30-02:00	Efficient Algorithms for Shared Camera Control
		Vladlen Koltun, UC Berkeley

Registration: (Pre-registration date: May 04, 2003)

Regular rate
Preregister before deadline $120/day
After preregistration deadline $140/day

Reduced Rate*
Preregister before deadline $60/day
After preregistration deadline $70/day

Postdocs
Preregister before deadline $10/day
After preregistration deadline $15/day

DIMACS Postdocs $0

Non-Local Graduate & Undergraduate students
Preregister before deadline $5/day
After preregistration deadline $10/day

Local Graduate & Undergraduate students $0
(Rutgers & Princeton)

DIMACS partner institution employees** $0

DIMACS long-term visitors*** $0

Registration fee to be collected on site, cash, check, VISA/Mastercard
accepted.

Our funding agencies require that we charge a registration fee for the
workshop. Registration fees cover participation in the workshop, all
workshop materials, breakfast, lunch, breaks, and any scheduled social
events (if applicable).

* College/University faculty and employees of non-profit organizations
will automatically receive the reduced rate. Other participants may
apply for a reduction of fees. They should email their request for the
reduced fee to the Workshop Coordinator at
workshop at dimacs.rutgers.edu. Include your name, the Institution you
work for, your job title and a brief explanation of your
situation. All requests for reduced rates must be received before the
preregistration deadline. You will promptly be notified as to the
decision about it.

** Fees for employees of DIMACS partner institutions are
waived. DIMACS partner institutions are: Rutgers University, Princeton
University, AT&T Labs - Research, Avaya, Bell Labs, NEC Research
Institute and Telcordia Technologies.

***DIMACS long-term visitors who are in residence at DIMACS for two or
more weeks inclusive of dates of workshop.

Information on participation, registration, accommodations, and travel
can be found at:

	http://dimacs.rutgers.edu/Workshops/GeomOpt/index.html

-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.