000 03370nam a22005895i 4500
001 978-3-319-28684-6
003 DE-He213
005 20200421111844.0
007 cr nn 008mamaa
008 160112s2015 gw | s |||| 0|eng d
020 _a9783319286846
_9978-3-319-28684-6
024 7 _a10.1007/978-3-319-28684-6
_2doi
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
_h[electronic resource] :
_b13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers /
_cedited by Laura Sanit�a, Martin Skutella.
250 _a1st ed. 2015.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aX, 209 p. 24 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9499
505 0 _aAlgorithmic game theory -- Algorithmic trading -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Graph algorithms -- Inapproximability -- Mechanism design -- Natural algorithms -- Network design -- Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. -Real-world applications.
520 _aThis book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015. The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems,and real-world applications.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aNumerical analysis.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aData Structures.
650 2 4 _aAlgorithms.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aNumeric Computing.
700 1 _aSanit�a, Laura.
_eeditor.
700 1 _aSkutella, Martin.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319286839
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9499
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-28684-6
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c55720
_d55720