LEADER 03884nam 22006015 450 001 996464427803316 005 20231006145145.0 010 $a3-030-92702-4 024 7 $a10.1007/978-3-030-92702-8 035 $a(MiAaPQ)EBC6838588 035 $a(Au-PeEL)EBL6838588 035 $a(CKB)20275117300041 035 $a(DE-He213)978-3-030-92702-8 035 $a(PPN)259385077 035 $a(EXLCZ)9920275117300041 100 $a20211222d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aApproximation and Online Algorithms$b[electronic resource] $e19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6?10, 2021, Revised Selected Papers /$fedited by Jochen Koenemann, Britta Peis 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (286 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12982 311 08$aPrint version: Koenemann, Jochen Approximation and Online Algorithms Cham : Springer International Publishing AG,c2021 9783030927011 320 $aIncludes bibliographical references and index. 327 $aHow 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12982 606 $aAlgorithms 606 $aMathematics$xData processing 606 $aComputational Mathematics and Numerical Analysis 606 $aAlgorismes en línia$2thub 606 $aOptimització matemàtica$2thub 608 $aCongressos$2thub 608 $aLlibres electrònics$2thub 615 0$aAlgorithms. 615 0$aMathematics$xData processing. 615 14$aComputational Mathematics and Numerical Analysis. 615 7$aAlgorismes en línia 615 7$aOptimització matemàtica 676 $a516.11 702 $aKoenemann$b Jochen 702 $aPeis$b Britta 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996464427803316 996 $aApproximation and Online Algorithms$92954916 997 $aUNISA