Get Free Shipping on orders over $89
Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications - Evripidis Bampis
eTextbook alternate format product

Instant online reading.
Don't wait for delivery!

Efficient Approximation and Online Algorithms

Recent Progress on Classical Combinatorial Optimization Problems and New Applications

By: Evripidis Bampis (Editor), Klaus Jansen (Editor), Claire Kenyon (Editor)

Paperback | 6 February 2006

At a Glance

Paperback


$84.99

or 4 interest-free payments of $21.25 with

 or 

Ships in 5 to 7 business days

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.

More in Graphics Programming

Developing Graphics Frameworks with Java and OpenGL - Lee Stemkoski
Curves and Surfaces for CAGD : A Practical Guide - Gerald Farin

RRP $210.95

$164.99

22%
OFF
The Book of WebGPU

$121.75

Spatial Humanities : The Spatial Humanities - Erik M. Champion

RRP $66.00

$53.75

19%
OFF
Rules of Play : Game Design Fundamentals - Katie Salen Tekinbas

RRP $180.00

$179.99

Animation Maths : Campus Handbook - Bieke Masselis

RRP $79.99

$62.99

21%
OFF
Corel Paint Shop Pro X : The Official Guide - David Huss

RRP $82.95

$70.75

15%
OFF
Encyclopedia of Global Population and Demographics - James Ciment