Cantitate/Preț
Produs
Total produse
Vezi coșul
Approximation and Online Algorithms de Klaus Jansen

Approximation and Online Algorithms: Theoretical Computer Science and General Issues

Editat de Klaus Jansen, Monaldo Mastrolilli
en Limba Engleză Paperback – 7 ian 2017
This book constitutes the thoroughly refereed post-workshop proceedings of the 14th International Workshop on Approximation and Online Algorithms, WAOA 2016, held in Aarhus, Denmark, in August 2016 as part of ALGO 2016. 
The 16 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 33 submissions. Topics of interest for WAOA 2016 were: coloring and partitioning, competitive analysis, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real world applications, and scheduling problems.
Citește tot Restrânge

Din seria Theoretical Computer Science and General Issues

Preț: 31750 lei

Preț vechi: 39688 lei
-20% Nou

Puncte Express: 476
Preț estimativ în valută:
5617€ • 6604$ • 4920£

Carte tipărită la comandă

Livrare economică 29 ianuarie-12 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319517407
ISBN-10: 3319517406
Pagini: 228
Ilustrații: XIV, 211 p. 23 illus.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.35 kg
Ediția:1st edition 2017
Editura: Springer
Seria Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Approximation Algorithms for the k-Set Packing Problem.- On Linear and Semidefinite Programs for Polytopes in Combinatorial Optimization.- The Shortest Separating Cycle Problem.- Dynamic Traveling Repair Problem with an Arbitrary Time Window.- A PTAS for the Cluster Editing Problem on Planar Graphs.- Bin Packing with Colocations.- Batch Coloring of Graphs.- New Integrality Gap Results for the Firefighters Problem on Trees.- A Multiplicative Weights Update Algorithm for Packing and Covering Semi-Infinite Linear Programs.- Balanced Optimization with Vector Costs.- Vertex Sparsification in Trees.- Scenario Submodular Cover.- Non-Greedy Online Steiner Trees on Outerplanar Graphs.- A Refined Analysis of Online Path Coloring in Trees.- Resource Allocation Games with Multiple Resource Classes.- Tight Approximation Bounds for the Seminar Assignment Problem.- A Priori TSP in the Scenario Model.- Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems. 

Caracteristici

Includes supplementary material: sn.pub/extras