Cantitate/Preț
Produs

Approximation and Online Algorithms: Lecture Notes in Computer Science, cartea 10787

Editat de Roberto Solis-Oba, Rudolf Fleischer
en Limba Engleză Paperback – apr 2018
This book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017.

The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32422 lei

Preț vechi: 40527 lei
-20%

Puncte Express: 486

Preț estimativ în valută:
5729 6640$ 4996£

Carte tipărită la comandă

Livrare economică 15-29 mai


Specificații

ISBN-13: 9783319894409
ISBN-10: 3319894404
Pagini: 340
Ilustrații: X, 329 p. 42 illus.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.52 kg
Ediția:1st ed. 2018
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Graph algorithms.- Inapproximability results.- Network design.- Packing and covering.- Paradigms for the design and analysis of approximation and online algorithms.- Parameterized complexity.- Scheduling problems.- Algorithmic game theory.- Coloring and partitioning.- Competitive analysis.- Computational advertising.- Computational finance.- Cuts and connectivity.- Geometric problems.- Mechanism design.- Resource augmentation.- Real-world applications.