LEADER 03953nam  22007815  450 
001 9910349424403321
005 20230222175657.0
010   $a3-319-89441-2
024 7 $a10.1007/978-3-319-89441-6
035   $a(CKB)4100000003092414
035   $a(DE-He213)978-3-319-89441-6
035   $a(MiAaPQ)EBC6300611
035   $a(MiAaPQ)EBC5578217
035   $a(Au-PeEL)EBL5578217
035   $a(OCoLC)1034555460
035   $a(PPN)226696537
035   $a(EXLCZ)994100000003092414
100   $a20180330d2018      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aApproximation and Online Algorithms $e15th International Workshop, WAOA 2017, Vienna, Austria, September 7?8, 2017, Revised Selected Papers /$fedited by Roberto Solis-Oba, Rudolf Fleischer
205   $a1st ed. 2018.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018.
215   $a1 online resource (X, 329 p. 42 illus.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10787
311   $a3-319-89440-4 
327   $aGraph 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 -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Mechanism design -- Resource augmentation -- Real-world applications.
330   $aThis book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017. The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 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; 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 ;$v10787
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aNumerical analysis
606   $aArtificial intelligence?Data processing
606   $aComputer networks
606   $aComputer graphics
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aNumerical Analysis
606   $aData Science
606   $aComputer Communication Networks
606   $aComputer Graphics
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aNumerical analysis.
615  0$aArtificial intelligence?Data processing.
615  0$aComputer networks.
615  0$aComputer graphics.
615 14$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aNumerical Analysis.
615 24$aData Science.
615 24$aComputer Communication Networks.
615 24$aComputer Graphics.
676   $a005.1
702   $aSolis-Oba$b Roberto$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aFleischer$b Rudolf$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910349424403321
996   $aApproximation and Online Algorithms$92954916
997   $aUNINA