Cover of Evripidis Bampis (EDT), Klaus Jansen (EDT), Claire Kenyon (EDT): Efficient Approximation and Online Algorithms

Evripidis Bampis (EDT), Klaus Jansen (EDT), Claire Kenyon (EDT) Efficient Approximation and Online Algorithms

Recent Progress on Classical Combinatorial Optimization Problems and New Applications

Price for Eshop: 1267 Kč (€ 50.7)

VAT 0% included

New

E-book delivered electronically online

E-Book information

Springer Berlin Heidelberg

2006

PDF
How do I buy e-book?

978-3-540-32213-9

3-540-32213-2

Annotation

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.

Ask question

You can ask us about this book and we'll send an answer to your e-mail.