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 Evripidis Bampis

Name: 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: 649 SEK
Availability: OutOfStock
Author: Evripidis Bampis

Pris

SEK 649

Beställningsvara

Förväntad leverans 8 - 22 jun

Våra kunder säger:

Top-vurdering på Google Reviews, baseret på tusinder af anmeldelser.

14 dagars returrätt

Toppbetyg på Trustpilot

Lägg till din iMusic-önskelista

eller

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

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	Böcker Pocketbok (Bok med mjukt omslag och limmad rygg)
Releasedatum	6 februari 2006
ISBN13	9783540322122
Utgivare	Springer-Verlag Berlin and Heidelberg Gm
Antal sidor	349
Mått	156 × 234 × 19 mm · 508 g
Språk	Franska