Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Book information
Description
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.
Similar books
Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications
2006 · PDF
Fundamentals of Computation Theory. 24th International Symposium, FCT 2023 Trier, Germany, September 18–21, 2023 Proceedings
2023 · PDF
Approximation and Online Algorithms. 8th International Workshop, WAOA 2010 Liverpool, UK, September 9-10, 2010 Revised Papers
2011 · PDF
Approximation and Online Algorithms: 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers
2017 · PDF
Approximation and Online Algorithms: 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers
2015 · PDF
Algorithmique: Exercices corrigés posés à l'oral du concours d'entrée à l'Ecole Normale Supérieure de Lyon
1998 · DJVU
Graph-Theoretic Concepts in Computer Science: 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers
2013 · PDF
Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002 Rome, Italy, September 17–21, 2002 Proceedings
2002 · PDF