Cantitate/Preț
Produs

Approximation and Online Algorithms: 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers: Lecture Notes in Computer Science, cartea 9499

Editat de Laura Sanità, Martin Skutella
en Limba Engleză Paperback – 3 feb 2016
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32860 lei

Preț vechi: 41075 lei
-20% Nou

Puncte Express: 493

Preț estimativ în valută:
6289 6481$ 5310£

Carte tipărită la comandă

Livrare economică 04-18 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319286839
ISBN-10: 3319286838
Pagini: 209
Ilustrații: X, 209 p. 24 illus. in color.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.31 kg
Ediția:1st ed. 2015
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

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. -Real-world applications.

Caracteristici

Includes supplementary material: sn.pub/extras