Monday
Tuesday
Wednesday
Thursday
Friday
Scope
The school aims at design and analysis of algorithms for dealing with hard optimization problems arising in practice. The topics are on on-line algorithms and approximation algorithms with provable performance guarantees in computer science such as server location, resource management in parallel and distributed systems, bin packing, robust algorithms, scheduling with precedence constraints.
In particular, the school will cover recent advances in the design and analysis of approximation algorithms and propose some open problems. Intensive exchange of knowledge between researchers from the different areas of theoretical computer science and optimization is expected. The main objective of the school is to expose the graduate students as well as young researchers in optimization, computer science to the front line of research topics usually not covered within the regular curricula. The working language is English.
The Spring school will take place in Zhejiang University, located in the center of Hangzhou, China on March 13-18, 2005. This event is organized by Group "Algorithmic Theory and Application", Department of Mathematics, Zhejiang University.
Confirmed Speakers
Janos Csirik, University of Szeged, Hungary Kazuo Iwama, Kyoto University, Japan Klaus Jansen, University of Kiel, Germany Denis Trystram, Laboratoire Informatique et Distribution-IMAG, France
How to Participate
Ph.D. students (as well as advanced graduate students), postdocs, junior researchers, and others interested in participating can now officially apply for this event. The number of participants will be limited to a maximum of about 40.
Attending the lectures is free of charge. Students who want to participate in the school should send an application letter with a short CV (stating also the previous knowledge in fields related to the theme of the school) and a brief letter of reference by a university professor to the following address until February 28, 2005. Application per email is preferable.