Friday
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 2005 will be part of ALGO 2005, which also hosts ESA, WABI, and ATMOS. ALGO will take place 3-7 October 2005 in Ibiza, Spain.
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
* randomization techniques
* real-world applications
* scheduling problems