Titre: Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications (Lecture Notes in Computer Science)
�diteur: Springer Berlin Heidelberg 2010-06-02
Date de parution: 2010
Langue: anglais
ISBN � 10 chiffres: 3540322124
ISBN � 13 chiffres: 9783540322122
Reliure: Paperback
�tat de l'article: New

A propos de ce titre

Synopsis

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.

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

Description de la librairie

Visitez la page d�accueil du vendeur

Informations commerciales relatives au vendeur

WRAP Ltd
Unit 4, 119 Loverock Rd, Reading, RG30 1DZ, United Kingdom

Conditions de vente et de livraison

Conditions g�n�rales de vente

TBA

Conditions d'exp�dition

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.