By Robert Krauthgamer, Aranyak Mehta, Atri Rudra (auth.), Christos Kaklamanis, Martin Skutella (eds.)
The 5th Workshop on Approximation and on-line Algorithms (WAOA 2007) excited about the layout and research of algorithms for on-line and computationally challenging difficulties. either varieties of difficulties have a number of purposes from quite a few ?elds. WAOA 2007 happened in Eilat, Israel, in the course of October 11–12, 2007. The workshop used to be a part of the ALGO 2007 occasion that still hosted ESA 2007, and PEGG 2007. the former WAOA workshops have been held in Budapest (2003), Rome (2004), Palma de Mallorca (2005) and Zurich (2006). The court cases of those past WAOA workshops have seemed as LNCS volumes 2909, 3351, 3879 and 4368, respectively. issues of curiosity for WAOA 2007 have been: algorithmic online game conception, appro- mation sessions, coloring and partitioning, aggressive research, computational ?nance, cuts and connectivity, geometric difficulties, inapproximability effects, mechanism layout, community layout, packing and overlaying, paradigms for layout and research of approximation and on-line algorithms, randomization strategies, real-world functions, and scheduling difficulties. based on the decision for - pers, we obtained fifty six submissions. each one submission was once reviewed through not less than 3 referees, and the overwhelming majority via a minimum of 4 referees. The submissions have been as a rule judged on originality, technical caliber, and relevance to the themes of the convention. in line with the stories, this system Committee chosen 22 papers. we're thankful to Andrei Voronkov for supplying the EasyChair convention procedure which used to be used to regulate the digital submissions, the evaluation method, and the digital computer assembly. It made our activity a lot easier.