LEADER 04618nam 22007575 450 001 9910799485803321 005 20251225210909.0 010 $a3-031-49815-1 024 7 $a10.1007/978-3-031-49815-2 035 $a(CKB)29449395400041 035 $a(DE-He213)978-3-031-49815-2 035 $a(MiAaPQ)EBC31051294 035 $a(Au-PeEL)EBL31051294 035 $a(EXLCZ)9929449395400041 100 $a20231221d2023 u| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aApproximation and Online Algorithms $e21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7?8, 2023, Proceedings /$fedited by Jaros?aw Byrka, Andreas Wiese 205 $a1st ed. 2023. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023. 215 $a1 online resource (XII, 236 p. 35 illus., 13 illus. in color.) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14297 311 08$a9783031498145 320 $aIncludes bibliographical references and index. 327 $aOptimization under Explorable Uncertainty: Adversarial and Stochastic Models -- Approximation Ineffectiveness of a Tour-Untangling Heuristic -- A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities -- Approximating Maximum Edge 2-Coloring by Normalizing Graphs -- An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem -- Greedy Minimum-Energy Scheduling -- Scheduling with Speed Predictions -- The Power of Amortization on Scheduling with Explorable Uncertainty -- Total Completion Time Scheduling Under Scenarios -- Approximating Fair k-Min-Sum-Radii in Euclidean Space -- Online hitting set of d-dimensional fat objects -- Approximation Schemes under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes -- Hitting Sets when the Shallow Cell Complexity is Small -- Any-Order Online Interval Selection -- Improved Approximations for Relative Survivable Network Design -- Independent set in k-Claw-Free Graphs: Conditional ?-boundedness and the Power of LP/SDP Relaxations -- Fast Parallel Algorithms for Submodular p-Superseparable Maximization. 330 $aThis book constitutes the refereed proceedings of the 21st International Workshop on Approximation and Online Algorithms, WAOA 2023, held in Amsterdam, The Netherlands, during September 7?8, 2023 The 16 full papers included in this book are carefully reviewed and selected from 43 submissions. The topics of WAOA 2023 were algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT-approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, resource augmentation, and scheduling problems. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v14297 606 $aMathematics$xData processing 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aAlgorithms 606 $aComputational Mathematics and Numerical Analysis 606 $aData Structures and Information Theory 606 $aDiscrete Mathematics in Computer Science 606 $aSymbolic and Algebraic Manipulation 606 $aNumerical Analysis 606 $aDesign and Analysis of Algorithms 615 0$aMathematics$xData processing. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aAlgorithms. 615 14$aComputational Mathematics and Numerical Analysis. 615 24$aData Structures and Information Theory. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aNumerical Analysis. 615 24$aDesign and Analysis of Algorithms. 676 $a518.1 702 $aByrka$b Jaros?aw 702 $aWiese$b Andreas$cDr.-Ing. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910799485803321 996 $aApproximation and Online Algorithms$92954916 997 $aUNINA