000 03716nam a22005055i 4500
001 978-3-030-92702-8
003 DE-He213
005 20240730181001.0
007 cr nn 008mamaa
008 211222s2021 sz | s |||| 0|eng d
020 _a9783030927028
_9978-3-030-92702-8
024 7 _a10.1007/978-3-030-92702-8
_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] :
_b19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected Papers /
_cedited by Jochen Koenemann, Britta Peis.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aXII, 275 p. 24 illus., 12 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 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12982
505 0 _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.
520 _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.
650 0 _aMathematics
_xData processing.
_919904
650 1 4 _aComputational Mathematics and Numerical Analysis.
_931598
700 1 _aKoenemann, Jochen.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9122816
700 1 _aPeis, Britta.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9122817
710 2 _aSpringerLink (Online service)
_9122818
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030927011
776 0 8 _iPrinted edition:
_z9783030927035
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12982
_9122819
856 4 0 _uhttps://doi.org/10.1007/978-3-030-92702-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c90623
_d90623