Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications - Lecture Notes in Computer Science / Theoretical Computer Science and General Issues - Evripidis Bampis - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783540322122 - February 6, 2006
In case cover and title do not match, the title is correct

Evripidis Bampis
Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications - Lecture Notes in Computer Science / Theoretical Computer Science and General Issues

Price
NZ$ 112
excl. VAT

Ordered from remote warehouse

Expected delivery Mar 26 - Apr 13

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Provides an opportunity for computer science practitioners and researchers to get in sync with the trends in the field of combinatorial optimization and online algorithms. This book focuses on the design of efficient approximation and on-line algorithms.

349 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released February 6, 2006
ISBN13 9783540322122
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 349
Dimensions 156 × 234 × 19 mm   ·   508 g
Language French  

More by Evripidis Bampis

Show all

See all of Evripidis Bampis ( e.g. Paperback Book )