Verificar estado da encomenda

Faça parte de uma comunidade de amantes de livros de todo o mundo e tenha acesso a uma série de benefícios. Crie uma conta gratuitamente

Correio DHL 7.99 € Correio DPD 4.49 € Ponto DPD 3.99 € Correio GLS 5.49 € Correio MRW 5.49 € Ponto GLS 4.49 €

Contacto

Como comprar

Ajuda

A minha conta

▸ Vazio :-(

Approximation Algorithms for Combinatorial Optimization

Name: Approximation Algorithms for Combinatorial Optimization
Brand: Springer, Berlin
SKU: 01567600
Price: 54.43 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

Língua

Inglês

Livro Capa mole

Código Libristo: 01567600

Editoras Springer, Berlin, novembro 1999

This book constitutes the refereed proceedings of the Third International Workshop on Approximation... Descrição completa

Código Libristo: 01567600

132 b

54.43 €

Armazenamento externo Envio em 5-8 dias

Até 30 dias para devoluções

Os clientes também compraram

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

Capa mole

32.07 €

Gdzie się schował samochód? Akademia mądrego dziecka. Zabawa w chowanego Opracowanie zbiorowe

Livro de capa dura

5.96 €

Louis Couperin (Suites) Rinaldo Alessandrini

CD de áudio

17.80 €

CURAR CON LA FUERZA DE LA NATURALEZA PETRA THORBRIETZ

Capa mole

19.12 €

Physikalisch modifizierte Stärke Konrad Treppe

Capa mole

64.05 €

Sinistros em Terminais Petroliferos na America Latina Claudio Antonio Garcia

Capa mole

50.50 €

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

Capa mole

42.80 €

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

Capa mole

22.76 €

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

Livro de capa dura

4.04 €

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.