000 03610nam a22005655i 4500
001 978-3-319-08001-7
003 DE-He213
005 20240730190129.0
007 cr nn 008mamaa
008 140610s2014 sz | s |||| 0|eng d
020 _a9783319080017
_9978-3-319-08001-7
024 7 _a10.1007/978-3-319-08001-7
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aApproximation and Online Algorithms
_h[electronic resource] :
_b11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers /
_cedited by Christos Kaklamanis, Kirk Pruhs.
250 _a1st ed. 2014.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2014.
300 _aX, 169 p. 20 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8447
505 0 _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.
520 _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.
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 1 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
700 1 _aKaklamanis, Christos.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9141364
700 1 _aPruhs, Kirk.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9141365
710 2 _aSpringerLink (Online service)
_9141366
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319080000
776 0 8 _iPrinted edition:
_z9783319080024
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8447
_9141367
856 4 0 _uhttps://doi.org/10.1007/978-3-319-08001-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93097
_d93097