|
| Scope |
|
The
workshop on approximation algorithms for combinatorial optimization
problems focuses on algorithmic and complexity aspects arising
in the development of efficient approximate solutions to computationally
difficult problems. It aims, in particular, at fostering the
cooperation among algorithmic and complexity researchers of
the field. The workshop, to be held at the Universita' di
Roma "La Sapienza", Roma, Italy, on September 17
- 21, 2002, is part of the ALGO
2002 event in conjunction with ESA'2002
and WABI
2002.
|
| Topics |
|
Papers
are solicited in all research areas related to approximation,
including, but not limited to: design and analysis of approximation
algorithms, inapproximability results, on-line problems, randomization
techniques, average-case analysis, approximation classes,
scheduling problems, routing and flow problems, coloring and
partitioning, cuts and connectivity, packing and covering,
geometric problem, network design, applications to game theory,
other applications.
|
| Important
dates |
| Submission
deadline |
May
20, 2002 |
| Notification
to authors |
June
20, 2002 |
| Final
version due |
July
8, 2002 |
|
Symposium
|
September
17-21, 2002 |
| Workshop
Chairs |
|
Klaus
Jansen, University of Kiel <kj@informatik.uni-kiel.de>
Stefano Leonardi, Universita' di Roma "La Sapienza"<leon@dis.uniroma1.it>
|
|
Program Chair |
|
Vijay
Vazirani, Georgia Tech
|
| Program
committee |
|
Giorgio
Ausiello, Rome
Josep Diaz, Barcelona
Ashish Goel, USC
Ravi Kannan, Yale
Sanjeev Khanna, UPenn
Elias Koutsoupias, UCLA
Ion Mandoiu, UCSD
Kurt Mehlhorn, Saarbrucken
Yuval Rabani, Technion
Eva Tardos, Cornell
Vijay Vazirani, Georgia Tech
Gerhard Woeginger, Twente University
Alexander Zelikovsky, Georgia State
|
| Previous
conferences |
| APPROX
2001, 4th International Workshop on Approximation Algorithms
for Combinatorial Optimization, Berkeley, CA, USA, 2001. |
| APPROX
2000, 3th International
Workshop on Approximation Algorithms for Combinatorial Optimization,
Saarbrücken, Germany, 2000. |
| APPROX
1999, 2nd International
Workshop on Approximation Algorithms for Combinatorial Optimization,
Berkeley, CA, USA, 1999. |
| APPROX
1998, 1st International
Workshop on Approximation Algorithms for Combinatorial Optimization,
Aalborg, Denmark, 1998. |
|
