ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

WAOA 2011 - 9th Workshop on Approximation and Online Algorithms

Date2011-09-08

Deadline2011-06-22

VenueSaarbrucke, Germany Germany

Keywords

Websitehttps://algo2011.mpi-inf.mpg.de

Topics/Call fo Papers

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

? graph algorithms

? inapproximability results

? mechanism design

? network design

? packing and covering

? paradigms for the 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.

Selected papers from the workshop will be published in a special issue of Theory of Computing Systems.

Last modified: 2011-04-07 20:50:53