000 04473nam a22006375i 4500
001 978-3-031-49815-2
003 DE-He213
005 20240730203147.0
007 cr nn 008mamaa
008 231221s2023 sz | s |||| 0|eng d
020 _a9783031498152
_9978-3-031-49815-2
024 7 _a10.1007/978-3-031-49815-2
_2doi
050 4 _aQA71-90
072 7 _aPBKS
_2bicssc
072 7 _aMAT041000
_2bisacsh
072 7 _aPBKS
_2thema
082 0 4 _a518
_223
245 1 0 _aApproximation and Online Algorithms
_h[electronic resource] :
_b21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings /
_cedited by Jarosław Byrka, Andreas Wiese.
250 _a1st ed. 2023.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2023.
300 _aXII, 236 p. 35 illus., 13 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14297
505 0 _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.
520 _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.
650 0 _aMathematics
_xData processing.
_919904
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 0 _aAlgorithms.
_93390
650 1 4 _aComputational Mathematics and Numerical Analysis.
_931598
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aDesign and Analysis of Algorithms.
_931835
700 1 _aByrka, Jarosław.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9174723
700 1 _aWiese, Andreas.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9174724
710 2 _aSpringerLink (Online service)
_9174725
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031498145
776 0 8 _iPrinted edition:
_z9783031498169
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14297
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-49815-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c97369
_d97369