Efficient Approximation and Online Algorithms
Publication year: 2006
ISBN: 978-3-540-32213-9
Internet Resource: Please Login to download book
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.
Subject: Computer Science, Computer, algorithm, algorithmics, algorithms, approximation, classification, combinatorial optimization, complexity theory, computational complexity, computational discrete mathematics, computational geometry, data mining, on-line algorithms, optimization
