ENGLISH

Approximation and Online Algorithms: 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006. Revised Papers

By Thomas Erlebach , Alexander A. Ageev , Alexander V. Kononov (auth.) , Christos Kaklamanis (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2007
ISBN
3540695133, 9783540695134
DOI
10.1007/11970125
Open Library ID
OL12810219M
Language
english
Format
PDF
Filesize
2 MB (1986712 bytes)
Series
Lecture Notes in Computer Science 4368 : Theoretical Computer Science and General Issues
Edition
1
Pages
346\140
Library
Kolxo3
Scanned
yes
Time added
2010-02-04 11:10:02
Algorithm Analysis and Problem Complexity; Discret

Description

This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006, held in Zurich, Switzerland in September 2006 as part of the ALGO 2006 conference event. The 26 revised full papers presented were carefully reviewed and selected from 62 submissions. Topics addressed by the workshop are 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, randomization techniques, real-world applications, and scheduling problems.

Similar books