Additional information
by Klaus Jansen (Editor), Roberto Solis-Oba (Editor)
The Workshop on Approximation and Online Algorithms (WAOA 2003) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications ar- ing from a variety of ?elds. The workshop also covered experimental research on approximation and online algorithms. WAOA 2003 took place in Budapest, Hungary, from September 16 to September 18. The workshop was part of the ALGO 2003 event, which also hosted ESA 2003, WABI 2003, and ATMOS 2003. TopicsofinterestforWAOA2003were: competitiveanalysis, inapproximab- ityresults, randomizationtechniques, approximationclasses, scheduling, coloring and partitioning, cuts and connectivity, packing and covering, geometric pr- lems, network design, and applications to game theory and ?nancial problems. In response to our call for papers we received 41 submissions. Each submission was reviewed by at least 3 referees, who judged the papers on originality, quality, and consistency with the topics of the conference. Based on these reviews the program committee selected 19 papers for presentation at the workshop and for publication in this proceedings. This volume contains the 19 selected papers and 5 invited abstracts from an ARACNE minisymposium which took place as part of WAOA.
