Call for Papers
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 arise from a large number of applications in 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.
Topics
Papers are solicited in all research areas related to approximation and online algorithms, including, but not limited to:
- graph algorithms
- inapproximability results
- network design
- packing and covering
- paradigms for the design and analysis of approximation and online algorithms
- parameterized complexity
- scheduling problems
- algorithmic game theory
- algorithmic trading
- coloring and partitioning
- competitive analysis
- computational advertising
- computational finance
- cuts and connectivity
- geometric problems
- mechanism design
- resource augmentation
- real-world applications
Publication
Proceedings will be published in the Springer series Lecture Notes in Computer Science after the workshop takes place. Instructions for authors of accepted papers can be found at Springer web site and in our submission guidlines.