ENGLISH

Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science, 3484)

By Evripidis Bampis (editor) , Klaus Jansen (editor) , Claire Kenyon (editor)

Book information

Publisher
Springer
Year
2006
ISBN
3540322124, 9783540322122
Language
english
Format
PDF
Filesize
5 MB (5165098 bytes)
Pages
356\355
Time added
2024-04-04 08:00:30

Description

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.

Similar books