WAOA 2009

WAOA 2009
7th Workshop on Approximation and Online Algorithms
Dates	Sep 10, 2009 (iCal) - Sep 11, 2009
Homepage:	algo2009.itu.dk/7th-waoa
Location
Location:	Copenhagen, Denmark
Loading map... {"minzoom":false,"maxzoom":false,"mappingservice":"leaflet","width":"280px","height":"280px","centre":false,"title":"","label":"","icon":"","visitedicon":"","lines":[],"polygons":[],"circles":[],"rectangles":[],"wmsoverlay":false,"copycoords":false,"static":false,"zoom":false,"defzoom":14,"layers":["OpenStreetMap"],"overlaylayers":[],"resizable":false,"enablefullscreen":false,"scrollwheelzoom":true,"markercluster":false,"clustermaxzoom":20,"clusterzoomonclick":true,"clustermaxradius":80,"clusterspiderfy":true,"geojson":"","locations":[{"text":"\u003Cb\u003E\u003Cdiv class=\"mw-parser-output\"\u003E\u003C/div\u003E\u003C/b\u003E\u003Chr /\u003E\u003Cdiv class=\"mw-parser-output\"\u003E\u003C/div\u003E","title":"","link":"","lat":55.6867243,"lon":12.5700724,"icon":""}],"imageoverlays":null}
Important dates
Submissions:	Jun 3, 2009
Table of Contents

     7th Workshop on Approximation and Online Algorithms

                     10-11 September 2009
                     Copenhagen, Denmark

               http://algo2009.itu.dk/7th-waoa

SCOPE: Approximation and online algorithms are fundamental tools
that 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 2009 will be part of
ALGO 2009, which also hosts ATMOS, ESA, and IWPEC.

ALGO will take place 7-11 September 2009 in Copenhagen, Denmark.

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

PUBLICATION: 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
http://www.springer.de/comp/lncs/authors.html. The proceedings of
WAOA 2003, WAOA 2004, WAOA 2005, WAOA 2006, WAOA 2007 and WAOA 2009 have
appeared as volumes 2909, 3351, 3879, 4368, 4927 and 5426 respectively,
of Lecture Notes in Computer Science.

SUBMISSION GUIDELINES: 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.


Authors who wish to submit a paper must submit a PostScript or PDF
file with their paper. Information about the electronic submission
system will be made available at the workshop website. The
submission must be received by 23:59 (GMT) on June 3, 2009. Each
accepted paper must be presented at the workshop by one of the
authors.

IMPORTANT DATES:

Submissions: June 3, 2009.        Notifications: July 15, 2009.
Workshop: September 10-11, 2009.  Camera Ready: November 1, 2009.

PROGRAM CHAIRS
* Evripidis Bampis, University of Evry
* Klaus Jansen, University of Kiel


PROGRAM COMMITTEE
* Vincenzo Auletta, University of Salerno
* Evripidis Bampis, University of Evry
* Nikhil Bansal, IBM Watson
* Constantinos Daskalakis, Microsoft Research and MIT
* Christoph Durr, CNRS, Ecole Polytechnique
* Friedrich Eisenbrand, EPFL Lausanne
* Thomas Erlebach, University of Leicester
* Klaus Jansen, University of Kiel
* Christos Kaklamanis, University of Patras
* Sanjeev Khanna, University of Pennsylvania
* Monaldo Mastrolilli, IDSIA Lugano
* Yuval Rabani, Technion Haifa
* Nicolas Schabanel, CNRS, University Paris 7
* Roberto Solis-Oba, University of Western Ontario
* Neal Young, University of California Riverside
* Guochuan Zhang, Zhejiang University Hangzhou
	

This CfP was obtained from WikiCFP