Name: Approximation and Online Algorithms: 11th International Workshop, Waoa 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers (en Inglés)
SKU: 58385389
Price: 51420.00 CLP
Availability: InStock
Author: Kaklamanis, Christos ; Pruhs, Kirk
ISBN: 9783319080000

portada Approximation and Online Algorithms: 11th International Workshop, Waoa 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers (en Inglés)

Approximation and Online Algorithms: 11th International Workshop, Waoa 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers (en Inglés)

Formato

Libro Físico

Editorial

Springer

Autor

Kaklamanis, Christos ; Pruhs, Kirk

Idioma

Inglés

N° páginas

169

Encuadernación

Tapa Blanda

Dimensiones

23.4x15.6x1 cm

Peso

0.26 kg.

ISBN13

9783319080000

Categorías

Matemáticas discretas
Aplicaciones gráficas y multimedia
Ciencias de la computación

Approximation and Online Algorithms: 11th International Workshop, Waoa 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers (en Inglés)

Kaklamanis, Christos ; Pruhs, Kirk (Autor) · Springer · Tapa Blanda

Libro Nuevo Importado

Envío: 12 a 17 días háb.

$ 93.490$ 51.420

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan más de 100 unidades

$ 51.420

Llega entre el 28 Sep y el 05 Oct a Santiago, Región Metropolitana. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Approximation and Online Algorithms: 11th International Workshop, Waoa 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers (en Inglés)"

This book constitutes the thoroughly refereed workshop proceedings of the 11th International Workshop on Approximation and Online Algorithms, WAOA 2013, held in Sophia Antipolis, France, in September 2013 as part of the ALGO 2013 conference event. The 14 revised full papers presented were carefully reviewed and selected from 33 submissions. They focus on the design and analysis of algorithms for online and computationally hard problems, for example in algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability results, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, real-world applications, scheduling problems.