APPROX 2000 will take place in Saarbrücken,
Germany, from September 5 until September 8, 2000. The
Max-Planck-Institute for Computer Science will be the local organizer.
APPROX 2000 is jointly organized with
ESA 2000 and
WAE 2000
in the framework of CONF 2000.
For general information please have a look at the site of
CONF 2000.
Important Dates
Submission of Papers:
April 3, 2000
Submissions (short abstracts):
May 1, 2000
Notification of Acceptance:
May 29, 2000
Final Version due:
July 10, 2000
Workshop:
September 6-8, 2000
Scope and Topics
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.