LEADER 03638nam  22006375  450 
001 9910483149503321
005 20251226193447.0
010   $a3-319-08001-6
024 7 $a10.1007/978-3-319-08001-7
035   $a(CKB)3710000000143871
035   $a(SSID)ssj0001274644
035   $a(PQKBManifestationID)11864757
035   $a(PQKBTitleCode)TC0001274644
035   $a(PQKBWorkID)11334070
035   $a(PQKB)11124825
035   $a(DE-He213)978-3-319-08001-7
035   $a(MiAaPQ)EBC3093463
035   $a(PPN)179766392
035   $a(EXLCZ)993710000000143871
100   $a20140610d2014      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aApproximation and Online Algorithms $e11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers /$fedited by Christos Kaklamanis, Kirk Pruhs
205   $a1st ed. 2014.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014.
215   $a1 online resource (X, 169 p. 20 illus.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8447
300   $aBibliographic Level Mode of Issuance: Monograph
311 08$a3-319-08000-8 
327   $aAlgorithmic game theory -- Algorithmic trading -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Graph algorithms -- Inapproximability results -- Mechanism design -- Natural algorithms -- Network design -- Packing and covering -- Paradigms for the design and analysis of approximation and online algorithms -- Parameterized complexity -- Real-world applications -- Scheduling problems.
330   $aThis book constitutes the thoroughly refereed workshop proceedings of the 11th International Workshop on Approximation and Online Algorithms, WAOA 2013, held in Sophia Antipolis, France, in September 2013 as part of the ALGO 2013 conference event. The 14 revised full papers presented were carefully reviewed and selected from 33 submissions. They focus on the design and analysis of algorithms for online and computationally hard problems, for example in algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability results, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, real-world applications, scheduling problems.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8447
606   $aAlgorithms
606   $aComputer science$xMathematics
606   $aDiscrete mathematics
606   $aNumerical analysis
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aNumerical Analysis
615  0$aAlgorithms.
615  0$aComputer science$xMathematics.
615  0$aDiscrete mathematics.
615  0$aNumerical analysis.
615 14$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aNumerical Analysis.
676   $a005.1
702   $aKaklamanis$b Christos$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aPruhs$b Kirk$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a9910483149503321
996   $aApproximation and Online Algorithms$92954916
997   $aUNINA