Approximation and Online Algorithms: 6th International Workshop, Waoa 2008, Karlsruhe, Germany, September 18-19, 2008, Revised Papers

ISBN-13: 9783540939795 / Angielski / Miękka / 2009 / 293 str.

Evripidis Bampis

Opis

The 6th Workshop on Approximation and Online Algorithms (WAOA 2008) focused on the design and analysis of algorithms for online and computati- ally hard problems. Both kinds of problems have a large number of appli- tions from a variety of ?elds. WAOA 2008 took place in Karlsruhe, Germany, during September 18-19, 2008. The workshop was part of the ALGO 2008 event that also hosted ESA 2008, WABI 2008, and ATMOS 2008. The pre- ous WAOA workshops were held in Budapest (2003), Rome (2004), Palma de Mallorca (2005), Zurich (2006), and Eilat (2007). The proceedings of these p- viousWAOA workshopsappearedasLNCS volumes2909,3351,3879,4368, and 4927, respectively. Topics of interest for WAOA 2008 were: algorithmic game theory, appro- mation classes, coloring and partitioning, competitive analysis, computational ?nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximationand online algorithms, randomizationtechniques, real-world applications, and scheduling problems. In response to the call for - pers, wereceived56submissions.Eachsubmissionwasreviewedbyatleastthree referees, and the vast majority by at least four referees. The submissions were mainly judged on originality, technical quality, and relevance to the topics of the conference. Based on the reviews, the Program Committee selected 22 papers. We are grateful to Andrei Voronkov for providing the EasyChair conference system, whichwasusedtomanagetheelectronicsubmissions, thereviewprocess, and the electronic PC meeting. It made our task much easier. We would also like to thank all the authors who submitted papers to WAOA 2008 as well as the local organizers of ALGO 2008.

Spis treści

WAOA 2008.- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees.- Size Versus Stability in the Marriage Problem.- Degree-Constrained Subgraph Problems: Hardness and Approximation Results.- A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines.- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs.- Minimizing Average Flow Time on Unrelated Machines.- Cooperation in Multiorganization Matching.- Randomized Algorithms for Buffer Management with 2-Bounded Delay.- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints.- Malicious Bayesian Congestion Games.- Stackelberg Strategies and Collusion in Network Games with Splittable Flow.- Peak Shaving through Resource Buffering.- On Lagrangian Relaxation and Subset Selection Problems.- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements.- Caching Content under Digital Rights Management.- Reoptimization of Weighted Graph and Covering Problems.- Smoothing Imprecise 1.5D Terrains.- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs.- Dynamic Offline Conflict-Free Coloring for Unit Disks.- Experimental Analysis of Scheduling Algorithms for Aggregated Links.- A Approximation Algorithm for the Minimum Maximal Matching Problem.- On the Maximum Edge Coloring Problem.

Blurb

This book constitutes the thoroughly refereed post workshop proceedings of the 6th International Workshop on Approximation and Online Algorithms, WAOA 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 conference event.

The 22 revised full papers presented were carefully reviewed and selected from 56 submissions. The workshop covered areas such as 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 for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems.