Approximation and Online Algorithms

19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers

Häftad, Engelska, 2021

809 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2021-12-23
Mått155 x 235 x 16 mm
Vikt441 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor275
FörlagSpringer Nature Switzerland AG
ISBN9783030927011

Tillhör följande kategorier

Beräkning och matematisk analys inom Naturvetenskap och teknik

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.