WAOA 2004
Second Workshop on Approximation and Online Algorithms
14 - 17 September 2004
Bergen, Norway
SCOPE:
Approximation and online algorithms are fundamental tools used to deal with
computationally hard problems and problems in which the input is gradually
disclosed over time. Both kinds of problems have a large number of applications
arising from a variety of fields.
The workshop focuses on the design and analysis of algorithms for online and
computationally hard problems. It also covers experimental methods used to
design and analyze efficient approximation and online algorithms. WAOA 2004
will be part of ALGO 2004, which will also host ESA 2004 and WABI 2004. The
event will take place in beautiful Bergen, Norway, from September 14 to
September 17.
TOPICS: Papers are solicited in all research areas related to approximation and online algorithms, including, but not limited to:
* applications to game theory * approximation classes * coloring and partitioning * competitive analysis * computational finance * cuts and connectivity * geometric problems * inapproximability results * mechanism design * network design * packing and covering * paradigms * randomization techniques * scheduling problemsPUBLICATION: Proceedings will be published after the workshop takes place in the series Lecture Notes in Computer Science. Instructions for authors can be found at http://www.springer.de/comp/lncs/authors.html. The proceedings of WAOA 2003 appeared as volume 2909 of Lecture Notes in Computer Science.
IMPORTANT DATES:
Submissions: June 25, 2004 Notifications: July 28, 2004 Workshop: September 14-17, 2004 Camera Ready: October 1, 2004
PROGRAM CHAIRs