10% off all books and free delivery over £40
Buy from our bookstore and 25% of the cover price will be given to a school of your choice to buy more books. *15% of eBooks.

Approximation and Online Algorithms Theoretical Computer Science and General Issues

View All Editions (1)

The selected edition of this book is not available to buy right now.
Add To Wishlist
Write A Review

About

Approximation and Online Algorithms Theoretical Computer Science and General Issues Synopsis

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.

About This Edition

ISBN: 9783540939795
Publication date:
Author: Evripidis Bampis, Martin Skutella
Publisher: Springer an imprint of Springer Berlin Heidelberg
Format: Paperback
Pagination: 293 pages
Series: Lecture Notes in Computer Science
Genres: Algorithms and data structures
Numerical analysis
Maths for computer scientists
Discrete mathematics
Graphics programming
Databases