001441384 000__ 04470cam\a2200685Ii\4500
001441384 001__ 1441384
001441384 003__ OCoLC
001441384 005__ 20230309004736.0
001441384 006__ m\\\\\o\\d\\\\\\\\
001441384 007__ cr\cn\nnnunnun
001441384 008__ 220103s2021\\\\sz\a\\\\o\\\\\101\0\eng\d
001441384 019__ $$a1292518324$$a1294357482
001441384 020__ $$a9783030927028$$q(electronic bk.)
001441384 020__ $$a3030927024$$q(electronic bk.)
001441384 020__ $$z9783030927011$$q(print)
001441384 0247_ $$a10.1007/978-3-030-92702-8$$2doi
001441384 035__ $$aSP(OCoLC)1290682056
001441384 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dEBLCP$$dDKU$$dOCLCO$$dDCT$$dOCLCF$$dOCLCO$$dCOM$$dOCLCO$$dOCLCQ
001441384 049__ $$aISEA
001441384 050_4 $$aQA76.9.A43$$bW36 2021eb
001441384 08204 $$a005.1$$223
001441384 1112_ $$aWAOA (Workshop)$$n(19th :$$d2021 :$$cOnline)
001441384 24510 $$aApproximation and online algorithms :$$b19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised selected papers /$$cJochen Koenemann, Britta Peis (eds.).
001441384 2463_ $$aWAOA 2021
001441384 264_1 $$aCham, Switzerland :$$bSpringer,$$c2021.
001441384 300__ $$a1 online resource (xii, 275 pages) :$$billustrations (some color).
001441384 336__ $$atext$$btxt$$2rdacontent
001441384 337__ $$acomputer$$bc$$2rdamedia
001441384 338__ $$aonline resource$$bcr$$2rdacarrier
001441384 347__ $$atext file$$bPDF$$2rda
001441384 4901_ $$aLecture notes in computer science ;$$v12982
001441384 4901_ $$aLNCS sublibrary, SL 1, Theoretical computer science and general issues
001441384 500__ $$a"WAOA 2021 took place virtually in Lisbon, Portugal"-- Preface.
001441384 500__ $$aIncludes author index.
001441384 5050_ $$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.
001441384 506__ $$aAccess limited to authorized users.
001441384 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.
001441384 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed January 3, 2022).
001441384 650_0 $$aOnline algorithms$$vCongresses.
001441384 650_0 $$aApproximation algorithms$$vCongresses.
001441384 650_0 $$aComputer science$$xMathematics.
001441384 650_6 $$aAlgorithmes en ligne$$vCongrès.
001441384 650_6 $$aAlgorithmes d'approximation$$vCongrès.
001441384 650_6 $$aInformatique$$xMathématiques.
001441384 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001441384 655_7 $$aConference papers and proceedings.$$2lcgft
001441384 655_7 $$aActes de congrès.$$2rvmgf
001441384 655_0 $$aElectronic books.
001441384 7001_ $$aKoenemann, Jochen,$$eeditor.
001441384 7001_ $$aPeis, Britta,$$eeditor.
001441384 77608 $$iPrint version: $$z9783030927011
001441384 77608 $$iPrint version: $$z9783030927035
001441384 830_0 $$aLecture notes in computer science ;$$v12982.
001441384 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
001441384 852__ $$bebk
001441384 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-92702-8$$zOnline Access$$91397441.1
001441384 909CO $$ooai:library.usi.edu:1441384$$pGLOBAL_SET
001441384 980__ $$aBIB
001441384 980__ $$aEBOOK
001441384 982__ $$aEbook
001441384 983__ $$aOnline
001441384 994__ $$a92$$bISE