Approximation and Online Algorithms : 8th International Workshop, Waoa 2010, Liverpool, Uk, September 9-10, 2010, Revised Papers. Questo articolo non è disponibile.
Lingua: inglese
Editore: Springer, 2011
- Brossura
- Nuovo

Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Venditore AbeBooks dal 6 aprile 2009
Condizione: Nuovo
EUR 67,63
Codice articolo 12217280-n
- Titolo
- Approximation and Online Algorithms : 8th International Workshop, Waoa 2010, Liverpool, Uk, September 9-10, 2010, Revised Papers
- Autore
- Jansen, Klaus (EDT); Solis-Oba, Roberto (EDT)
- Editore
- Springer
- Anno di pubblicazione
- 2011
- Condizione
- New
- Rilegatura
- Brossura
- Lingua
- inglese
- ISBN 10
- 3642183174
- ISBN 13
- 9783642183171
This book constitutes the thoroughly refereed post workshop proceedings of the 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event.
The 23 revised full papers presented were carefully reviewed and
selected from 58 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, echanism
design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized
complexity, randomization techniques, real-world applications, and
scheduling problems.
"Riassunto" può appartenere a un’altra edizione di questo titolo.
Dalla quarta di copertina
This book constitutes the thoroughly refereed post workshop proceedings of the 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event.
The 23 revised full papers presented were carefully reviewed and
selected from 58 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, parameterized complexity, randomization techniques, real-world applications, and scheduling problems.
"Descrizione articolo" può appartenere a un’altra edizione di questo titolo.