This book provides a good opportunity for computer science practitioners and researchers to get in sync with 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.
Format: Paperback / softback
CONTRIBUTORS: Evripidis Bampis
EAN: 9783540322122
COUNTRY: Germany
PAGES:
WEIGHT: 557 g
HEIGHT: 235 cm
PUBLISHED BY: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
DATE PUBLISHED: 2006-02-06
CITY:
GENRE: COMPUTERS / Software Development & Engineering / Computer Graphics, COMPUTERS / Data Science / General, COMPUTERS / Programming / Algorithms, COMPUTERS / Networking / Hardware
WIDTH: 155 cm
SPINE:
Book Themes:
Discrete mathematics, Numerical analysis, Network hardware, Algorithms and data structures, Graphics programming, Maths for computer scientists
