8^th Workshop on Approximation and Online Algorithms

9^th - 10^th September 2010
University of Liverpool, United Kingdom

News

The combined ATMOS/WAOA schedule (PDF) is now available.

HTML versions for each day can also be found here:

• Thursday, 9^th Sept (ATMOS/WAOA)
• Friday, 10^th Sept (WAOA)

The list of papers accepted to WAOA is now available.

Scope

Approximation and online algorithms are fundamental tools 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 approximation and online algorithms. It also covers experimental methods used to design and analyze efficient approximation and online algorithms.

Call for Papers

Authors are invited to submit an extended abstract or full paper of at most 12 pages describing original unpublished research. Simultaneous submission to other conferences with published proceedings is not permitted. The title page of the submission should include the authors' full names, addresses, e-mail addresses, and an abstract summarizing the results in roughly 100-200 words; the remainder of the submission should contain a description of the main results and an explanation of their importance. The submission must include a full proof of the results, part of which can be placed in the appendix, whose length is not constrained.

Papers must be submitted electronically at the EasyChair submission server.

The submission must be received by 23:59 (GMT) on June 14, 2010. Each accepted paper must be presented at the workshop by one of the authors.

Invited Speaker

Claire Mathieu Brown University

Topics

Papers are solicited in all research areas related to approximation and online algorithms, including, but not limited to:

• Algorithmic 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 for design and analysis of approximation and online algorithms
• Parameterized complexity
• Randomization techniques
• Real-world applications
• Scheduling problems

Proceedings

Proceedings will be published after the workshop takes place in the Springer series Lecture Notes in Computer Science.

Instructions for authors can be found at the Springer website. The proceedings of WAOA 2003, WAOA 2004, WAOA 2005, WAOA 2006, WAOA 2007, WAOA 2008, and WAOA 2009 have appeared as volumes 2909, 3351, 3879, 4368, 4927, 5426, and 5893, respectively, of Lecture Notes in Computer Science.

Program Committee

• Klaus Jansen (co-chair), University of Kiel
• Roberto Solis-Oba (co-chair), University of Western Ontario
• Evripidis Bampis, University of Evry
• Jianer Chen, Texas A&M University
• Jose Correa, Universidad de Chile
• Khaled Elbassioni, Max Planck Institut für Informatik
• Rudolf Fleischer, Fudan University
• Thomas Erlebach, University of Leicester
• Martin Fürer, The Pennsylvania State University
• Christos Kaklamanis, University of Patras
• Jochen Könemann, University of Waterloo
• Stefano Leonardi, Sapienza University of Rome
• Alejandro López-Ortiz, University of Waterloo
• Monaldo Mastrolilli, IDSIA Lugano
• Hadas Shachnai, Israel Institute of Technology
• Martin Skutella, TU Berlin
• Clifford Stein, Columbia University
• Denis Trystram, Grenoble Institute of Technology

For more information, please contact Klaus Jansen or Roberto Solis-Oba.