Name: Approximation and Online Algorithms: 13Th International Workshop, Waoa 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers (Lecture Notes in Computer Science) (en Inglés)
Price: 82050.00 CLP
Availability: InStock
ISBN: 9783319286839

portada Approximation and Online Algorithms: 13Th International Workshop, Waoa 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers (Lecture Notes in Computer Science) (en Inglés)

Formato

Libro Físico

Editorial

Springer

Año

2016

Idioma

Inglés

N° páginas

209

Encuadernación

Tapa Blanda

ISBN13

9783319286839

N° edición

Categorías

Teoría matemática de la computación
Machine learning: aprendizaje automático

Approximation and Online Algorithms: 13Th International Workshop, Waoa 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers (Lecture Notes in Computer Science) (en Inglés)

Libro Nuevo

$ 82.050

$ 136.750

Ahorras: $ 54.700

40% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Viernes 09 de Agosto y el Viernes 16 de Agosto.

Lo recibirás en cualquier lugar de Chile entre 1 y 3 días hábiles luego del envío.

Reseña del libro "Approximation and Online Algorithms: 13Th International Workshop, Waoa 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers (Lecture Notes in Computer Science) (en Inglés)"

This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015. The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems,and real-world applications.