About these proceedings
The 2nd Workshop on Approximation and Online Algorithms (WAOA 2004) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications arising from a variety of ?elds. WAOA 2004 took place in Bergen, Norway, from September 14 to September 16, 2004. The workshop was part of the ALGO 2004 event which also hosted ESA, WABI, IWPEC, and ATMOS. TopicsofinterestsforWAOA2004were:applicationstogametheory,appr- imation classes, coloring and partitioning, competitive analysis, computational ?nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems. In response to our call we received 47 submissions. Each submission was reviewed by at least 3 referees, who judged the paper on originality, quality, and consistency with the topics of the conference. Based on the reviews, the Program Committee selected 21 papers. This volume contains the 21 selected papers and the two invited talks given by Yossi Azar and Klaus Jansen. We thank all the authors who submitted papers to the workshop and we also kindly thank the local organizers of ALGO 2004.
algorithm analysis algorithm design algorithms approximation algorithms combinatorial optimization computational graph theory discrete mathematics game theory geometric algorithms graph algorithms network algorithms online algorithms optimization randomized algorithms