WAOA 2012 - Workshop on Approximation and Online Algorithms

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. WAOA 2012 will be part of ALGO 2012, which also hosts ESA, WABI, ALGOSENSORS, ATMOS, IPEC and MASSIVE. ALGO will take place 9-14 September 2012 in Ljubljana, Slovenia.
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
graph problems
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