Atlas home || Conferences | Abstracts | about Atlas
Host: Max-Planck-Institut für Informatik
Homepage: http://www.mpi-sb.mpg.de/~conf2000/approx2000/
Organizers: Klaus Jansen (Chair, University of Kiel), Samir Khuller (PC chair, University of Maryland)
Deadline for abstracts: March 26, 2000
Description:
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. 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 and various applications.
Date received: February 28, 2000
© 2008 Atlas Conferences Inc.