FlazX | Categories | Forum | Links | Blog | Login


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



eBook Information



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

ISBN  3540322124
Release Date  16 March 2006
Category  Algorithms
Tags  optimization,  
approximation,  
combinatorial,  
algorithm,  
algorithms,  
ogre,  
progress,  
"combinatorial optimization",  
3540322124,  
online,  
optimi,  
lecture notes,  
combinatorial optimization,  
air,  
This book @Amazon  View

Tools



Google Search

Google
Web flazx.com

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.









Top 100 Search Keywords
Last 100 Search Keywords

Nokia Themes
Free Download
Daily Internet Guide
EgyDown
Share4All
FreeBookCity.Com
Providings.com
DownArchive
Allulook4.com
eu-warez.net




eXTReMe Tracker