Efficient Approximation and Online Algorithms

číslo produktu:108264

rezervuj

Efficient Approximation and Online Algorithms

Bampis

Rok vydania: 2006

Vydavateľ: Springer

Kniha je momentálne nedostupná.

V prípade dlhodobého záujmu si urobte REZERVÁCIU a my vám odložíme žiadaný kus.

O knihe:

This book provides a good opportunity for computer science practitioners and researchers to get in sync with the current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques. This state-of-the-art survey contains 11 carefully selected papers that cover some classical problems of scheduling, of packing, and of graph theory, but also new optimization problems arising in various applications like networks, data mining or classification.

Zaradenie do kategórii:

Podrobnosti o titule (výrobné údaje):

Vydavateľstvo: Springer

Rok vydania: 2006

ISBN: 978-3-540-32212-2

(9783540322122)

Väzba: mäkká