Approximation and Online Algorithms: Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers: 3351 (Lecture Notes in Computer Science) - Softcover

Persiano, Giuseppe; Solis-Oba, Roberto

Softcover

ISBN 10: 354024574X ISBN 13: 9783540245742

Verlag: Springer, 2008

Inhaltsangabe

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.

Über diesen Titel

Reseña del editor

This book constitutes the thoroughly refereed post proceedings of the Second International Workshop on Approximation and Online Algorithms, WAOA 2004, held in Bergen, Norway in September 2004. The 21 revised full papers presented together with 2 invited papers were carefully selected during two rounds of reviewing and improvement from 47 submissions. WAOA is devoted to the design and analysis of algorithms for online and computationally hard problems. Among the topics addressed are applications to game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric computations, inapproximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems.

Details zur Ausgabe

• Verlag: Springer
• Erscheinungsdatum: 2008
• ISBN 10: 354024574X
• ISBN 13: 9783540245742
• Einband: Tapa blanda
• Sprache: Englisch
• Anzahl der Seiten: 308
• Kontakt zum Hersteller: Nicht verfügbar