000 03733nam a22005415i 4500
999 _c200434178
_d52390
003 DE-He213
005 20231104114322.0
007 cr nn 008mamaa
008 160112s2015 gw | s |||| 0|eng d
020 _a9783319286846
_z978-3-319-28684-6
024 7 _a10.1007/978-3-319-28684-6
_2doi
040 _aTR-AnTOB
_beng
_cTR-AnTOB
_erda
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema005.1
_223
245 1 0 _aApproximation and Online Algorithms :
_b13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers /
_cedited by Laura Sanità, Martin Skutella.
250 _a1st ed. 2015.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _a1 online resource
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 0 _aTheoretical Computer Science and General Issues ;
_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 software.
650 0 _aComputational complexity.
650 0 _aData structures (Computer scienc.
650 0 _aAlgorithms.
650 0 _aComputer science.
650 0 _aElectronic data processing.
650 1 4 _aAlgorithm Analysis and Problem Complexity.
_0http://scigraph.springernature.com/things/product-market-codes/I16021
650 2 4 _aDiscrete Mathematics in Computer Science.
_0http://scigraph.springernature.com/things/product-market-codes/I17028
650 2 4 _aData Structures.
_0http://scigraph.springernature.com/things/product-market-codes/I15017
650 2 4 _aAlgorithms.
_0http://scigraph.springernature.com/things/product-market-codes/M14018
650 2 4 _aComputation by Abstract Devices.
_0http://scigraph.springernature.com/things/product-market-codes/I16013
650 2 4 _aNumeric Computing.
_0http://scigraph.springernature.com/things/product-market-codes/I1701X
700 1 _aSanità, Laura.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSkutella, Martin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
856 4 0 _3Springer eBooks
_zOnline access link to the resource
_uhttps://doi.org/10.1007/978-3-319-28684-6
942 _2lcc
_cEBK
041 _aeng