LEADER 04151nam  22008415  450 
001 9910490024503321
005 20231006194957.0
010   $a3-030-80879-3
024 7 $a10.1007/978-3-030-80879-2
035   $a(CKB)5590000000527064
035   $a(MiAaPQ)EBC6668436
035   $a(Au-PeEL)EBL6668436
035   $a(OCoLC)1260343437
035   $a(DE-He213)978-3-030-80879-2
035   $a(PPN)257358919
035   $a(EXLCZ)995590000000527064
100   $a20210705d2021      u|         0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aApproximation and Online Algorithms $e18th International Workshop, WAOA 2020, Virtual Event, September 9?10, 2020, Revised Selected Papers /$fedited by Christos Kaklamanis, Asaf Levin
205   $a1st ed. 2021.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021.
215   $a1 online resource (247 pages)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12806
311   $a3-030-80878-5 
327   $aDesign and analysis of algorithms -- Online algorithms, approximation algorithms analysis -- Algorithmic game theory and mechanism design -- Parameterized complexity -- Scheduling algorithms -- Competitive analysis. Packing and covering problems -- Rounding techniques.
330   $aThis book constitutes the thoroughly refereed workshop post-proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2019, held virtually in September 2020 as part of ALGO 2020. The 15 revised full papers presented this book were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2018 were graph algorithms, inapproximability results, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems, algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational -finance, cuts and connectivity, geometric problems, mechanism design, resource augmentation, real-world applications. Chapter "Explorable Uncertainty in Scheduling with Non-Uniform Testing Times" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12806
606   $aAlgorithms
606   $aComputer science$xMathematics
606   $aDiscrete mathematics
606   $aData structures (Computer science)
606   $aInformation theory
606   $aComputer science
606   $aApplication software
606   $aAlgorithms
606   $aSymbolic and Algebraic Manipulation
606   $aDiscrete Mathematics in Computer Science
606   $aData Structures and Information Theory
606   $aTheory of Computation
606   $aComputer and Information Systems Applications
606   $aAlgorismes en línia$2thub
606   $aOptimització matemàtica$2thub
608   $aCongressos$2thub
608   $aLlibres electrònics$2thub
615  0$aAlgorithms.
615  0$aComputer science$xMathematics.
615  0$aDiscrete mathematics.
615  0$aData structures (Computer science).
615  0$aInformation theory.
615  0$aComputer science.
615  0$aApplication software.
615 14$aAlgorithms.
615 24$aSymbolic and Algebraic Manipulation.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aData Structures and Information Theory.
615 24$aTheory of Computation.
615 24$aComputer and Information Systems Applications.
615  7$aAlgorismes en línia
615  7$aOptimització matemàtica
676   $a005.1
702   $aKaklamanis$b Christos
702   $aLev?in$b Asaf
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910490024503321
996   $aApproximation and Online Algorithms$92954916
997   $aUNINA