Cantitate/Preț
Produs
Total produse
Vezi coșul
Approximation and Online Algorithms: 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers de Jochen Koenemann

Approximation and Online Algorithms: 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers: Lecture Notes in Computer Science, cartea 12982

Editat de Jochen Koenemann, Britta Peis
en Limba Engleză Paperback – 23 dec 2021
This book constitutes the thoroughly refereed workshop post-proceedings of the 19th International Workshop on Approximation and Online Algorithms, WAOA 2021, held in September 2021. Due to COVID-19 pandemic the conference was held virtually. The 16 revised full papers presented in this book were carefully reviewed and selected from 31 submissions. The papers focus on the design and analysis of algorithms for online and computationally hard problems.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 44502 lei

Nou

Puncte Express: 668
Preț estimativ în valută:
8530€ • 8953$ • 7036£

Carte tipărită la comandă

Livrare economică 23 ianuarie-06 februarie 25

 Adaugă în coș

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

Specificații

ISBN-13: 9783030927011
ISBN-10: 3030927016
Pagini: 275
Ilustrații: XII, 275 p. 24 illus., 12 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.41 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

How to Navigate Through Obstacles.- Approximation Algorithms for Vertex- Connectivity Augmentation on the Cycle.- Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set.-An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity.- Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs.- On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem.- The Traveling k-Median Problem: Approximating Optimal Network Coverage.- EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource.- Several methods of analysis for cardinality constrained bin packing.- Leah Epstein Weighted completion time minimization for capacitated parallel machines.- Server Cloud Scheduling.- FIFO and Randomized Competitive Packet Routing Games.- Improved Online Algorithm for Fractional Knapsack in the Random Order Model.- Improved Online Algorithm for Fractional Knapsack in the Random Order Model.- Improved Analysis of Online Balanced Clustering.- Precedence-Constrained Covering Problems with Multiplicity Constraints.- Contention Resolution, Matrix Scaling and Fair Allocation.