000 03536nam a22005415i 4500
001 vtls000543631
003 RU-ToGU
005 20210922082749.0
007 cr nn 008mamaa
008 160915s2014 gw | s |||| 0|eng d
020 _a9783319080017
_9978-3-319-08001-7
024 7 _a10.1007/978-3-319-08001-7
_2doi
035 _ato000543631
040 _aSpringer
_cSpringer
_dRU-ToGU
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aApproximation and Online Algorithms
_helectronic resource
_b11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers /
_cedited by Christos Kaklamanis, Kirk Pruhs.
260 _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
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_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 _aComputer Science.
_9155490
650 0 _aComputer software.
_9303280
650 0 _aElectronic data processing.
_9303503
650 0 _aComputational complexity.
_9304814
650 0 _aAlgorithms.
_9304813
650 1 4 _aComputer Science.
_9155490
650 2 4 _aAlgorithm Analysis and Problem Complexity.
_9303732
650 2 4 _aDiscrete Mathematics in Computer Science.
_9304816
650 2 4 _aNumeric Computing.
_9303733
650 2 4 _aAlgorithms.
_9304813
700 1 _aKaklamanis, Christos.
_eeditor.
_9327409
700 1 _aPruhs, Kirk.
_eeditor.
_9450599
710 2 _aSpringerLink (Online service)
_9143950
773 0 _tSpringer eBooks
830 0 _aLecture Notes in Computer Science,
_9279505
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-08001-7
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c401409