Brezplačna dostava za naročila nad 69,99 € na prevzemna mesta DPD in Express One.

Preverjanje stanja naročila

Postanite del skupnosti ljubiteljev knjig z vsega sveta in uživajte v številnih ugodnostih. Ustvarite brezplačen račun

Brezplačna dostava Zásilkovna nad 69.99 €

Zbirna točka GLS 4.99 € Zbirna točka DPD 3.49 € Kurirska služba GLS 5.99 € Kurir DPD 3.99 € Kurirska služba Express One 3.99 € Zbirno mesto Express One 3.99 € Zbirno mesto Pošte Slovenije 3.99 € Dostava preko Pošte Slovenije 3.99 €

Kontakt

Kako nakupovati

Pomoč

Moj račun

▸ Prazna :-(

Brezplačna dostava za naročila nad 69,99 € na prevzemna mesta DPD in Express One.

WALCOM: Algorithms and Computation

Name: WALCOM: Algorithms and Computation
Brand: Springer, Berlin
SKU: 01662960
Price: 48.46 EUR
Availability: InStock
Author: Subir Kumar Ghosh
ISBN: 9783642360640

7th International Workshop, WALCOM 2013, Kharagpur, India, February 14-16, 2013, Proceedings

Subir Kumar Ghosh

Takeshi Tokuyama

Jezik

Angleščina

Knjiga Mehka

Koda Libristo: 01662960

Založba Springer, Berlin, november 2012

This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and C... Celoten opis

Koda Libristo: 01662960

118 b

48.46 €

Na zalogi pri dobavitelju Odposlali bomo v 5-8 dneh

Do 30 dni za vračilo

Drugi so kupili tudi

Escalamiento territorial de la cogestion de cuencas hidrograficas Hernandez Garcia Noreen Antonia

Mehka

248.45 €

Aanandmayi Baa: Gujarati Varta Sangrah Dr Indubahen Shah

Mehka

7.82 €

Opera Lyrica (1767) Stanlslai Konarski

Mehka

24.27 €

Una infancia de cine Cano

Mehka

11.63 €

This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, in February 2013. The 29 full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on computational geometry, approximation and randomized algorithms, parallel and distributed computing, graph algorithms, complexity and bounds, and graph drawing.