.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Approximation and Online Algorithms
N/A
€ 67.07
FREE Delivery in Ireland
Description for Approximation and Online Algorithms
Paperback. Constitutes the 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. This title includes 22 revised full papers that were reviewed and selected from 56 submissions. Series: Lecture Notes in Computer Science / Theoretical Computer Science and General Issues. Num Pages: 303 pages, biography. BIC Classification: UM. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 18. Weight in Grams: 468.
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.
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.
Product Details
Format
Paperback
Publication date
2009
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
303
Condition
New
Series
Lecture Notes in Computer Science / Theoretical Computer Science and General Issues
Number of Pages
293
Place of Publication
Berlin, Germany
ISBN
9783540939795
SKU
V9783540939795
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Approximation and Online Algorithms