دانلود کتاب Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications

Name: Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Availability: InStock
Author: Foto N. Afrati (auth.)
ISBN: 3540322124, 9783540322122

by Foto N. Afrati (auth.), Evripidis Bampis, Klaus Jansen, Claire Kenyon (eds.)

عنوان فارسی: تقریب کارآمد و الگوریتم آنلاین: پیشرفت های اخیر در کلاسیک مسائل ترکیبی بهینه سازی و برنامه های جدید
ناشر: Springer-Verlag Berlin Heidelberg
سال: 2006
ویرایش: 1
زبان: انگلیسی
تعداد صفحه (نسخه چاپی - نسخه الکترونیکی): 349-354
شابک: 3540322124, 9783540322122
نوع فایل: PDF دانلود نرم افزار مطالعه
حجم: 3.00 مگابایت

گزارش تخلف

دانلود کتاب

افزودن خلاصه فارسی

جزییات کتاب

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.