LEADER 04012nam  22007575  450 
001 996418220903316
005 20230329233308.0
010   $a3-030-39479-4
024 7 $a10.1007/978-3-030-39479-0
035   $a(CKB)4100000010121596
035   $a(DE-He213)978-3-030-39479-0
035   $a(MiAaPQ)EBC6114230
035   $a(PPN)242845061
035   $a(EXLCZ)994100000010121596
100   $a20200124d2020      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aApproximation and Online Algorithms$b[electronic resource] $e17th International Workshop, WAOA 2019, Munich, Germany, September 12?13, 2019, Revised Selected Papers /$fedited by Evripidis Bampis, Nicole Megow
205   $a1st ed. 2020.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020.
215   $a1 online resource (XII, 253 p. 44 illus., 25 illus. in color.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11926
300   $aIncludes index.
311   $a3-030-39478-6 
327   $aGraph Algorithms -- Inapproximability Results -- Network Design -- Design and Analysis of Approximation and Online Algorithms -- Parameterized Complexity -- Algorithmic Game Theory -- Algorithmic trading -- Competitive analysis -- Computational Advertising -- Computational finance -- Geometric problems -- Mechanism Design. .
330   $aThis book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019. The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 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; and real-world applications.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11926
606   $aMathematics?Data processing
606   $aComputer engineering
606   $aComputer networks
606   $aApplication software
606   $aComputer science
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aComputational Mathematics and Numerical Analysis
606   $aComputer Engineering and Networks
606   $aComputer and Information Systems Applications
606   $aTheory of Computation
606   $aDiscrete Mathematics in Computer Science
606   $aSymbolic and Algebraic Manipulation
615  0$aMathematics?Data processing.
615  0$aComputer engineering.
615  0$aComputer networks.
615  0$aApplication software.
615  0$aComputer science.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615 14$aComputational Mathematics and Numerical Analysis.
615 24$aComputer Engineering and Networks.
615 24$aComputer and Information Systems Applications.
615 24$aTheory of Computation.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aSymbolic and Algebraic Manipulation.
676   $a518
702   $aBampis$b Evripidis$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aMegow$b Nicole$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996418220903316
996   $aApproximation and Online Algorithms$92954916
997   $aUNISA