Spedizione gratuita per ordini superiori a 69,99 euro.

Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Spedizione gratuita con Packeta per un prezzo superiore a 69.99 €

Bartolini 4.49 € Punto Poste 5.49 € Punto Poste 5.49 € Punto Bartolini 3.49 € DHL 6.99 € GLS 5.99 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Spedizione gratuita per ordini superiori a 69,99 euro.

Approximation Algorithms for Combinatorial Optimization

Name: Approximation Algorithms for Combinatorial Optimization
Brand: Springer, Berlin
SKU: 01567600
Price: 53.79 EUR
Availability: InStock
Author: Klaus Jansen
ISBN: 9783540679967

Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings

Klaus Jansen

Samir Khuller

Lingua

Inglese

Libro In brossura

Codice Libristo: 01567600

Casa editrice Springer, Berlin, novembre 1999

This book constitutes the refereed proceedings of the Third International Workshop on Approximation... Descrizione completa

Codice Libristo: 01567600

132 b

53.79 €

Magazzino esterno Inviamo tra 5-8 giorni

30 giorni per il reso

I clienti hanno acquistato anche

Histoire de l'Eglise. Tome 1 (Ed.1703-1723) Francois Timoleon De Choisy

In brossura

34.29 €

Introducción a la energía eólica INNOVACION Y CUALIFICACION

In brossura

24.79 €

CURAR CON LA FUERZA DE LA NATURALEZA PETRA THORBRIETZ

In brossura

20.99 €

Louis Couperin (Suites) Rinaldo Alessandrini

CD audio

17.59 €

Physikalisch modifizierte Stärke Konrad Treppe

In brossura

63.29 €

Sinistros em Terminais Petroliferos na America Latina Claudio Antonio Garcia

In brossura

46.59 €

Veselé pohádky z muzikantské zahrádky Marie Kubátová

Rigido

4.29 €

Entwurf und Implementierung eines Analyse-Tools zur statistischen Auswertung von E-Learning-Aktivitaten Marcel Minke

In brossura

44.79 €

This book constitutes the refereed proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2000, held in Saarbrücken, Germany in September 2000. The 22 revised full papers presented together with four invited contributions were carefully reviewed and selected from 68 submissions. The topics dealt with include design and analysis of approximation algorithms, inapproximibility results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.