000 | 03700nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-030-39479-0 | ||
003 | DE-He213 | ||
005 | 20240423125120.0 | ||
007 | cr nn 008mamaa | ||
008 | 200124s2020 sz | s |||| 0|eng d | ||
020 |
_a9783030394790 _9978-3-030-39479-0 |
||
024 | 7 |
_a10.1007/978-3-030-39479-0 _2doi |
|
050 | 4 | _aQA71-90 | |
072 | 7 |
_aPBKS _2bicssc |
|
072 | 7 |
_aMAT041000 _2bisacsh |
|
072 | 7 |
_aPBKS _2thema |
|
082 | 0 | 4 |
_a518 _223 |
245 | 1 | 0 |
_aApproximation and Online Algorithms _h[electronic resource] : _b17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers / _cedited by Evripidis Bampis, Nicole Megow. |
250 | _a1st ed. 2020. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2020. |
|
300 |
_aXII, 253 p. 44 illus., 25 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 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v11926 |
|
505 | 0 | _aGraph Algorithms -- Inapproximability Results -- Network Design -- Design and Analysis of Approximation and Online Algorithms -- Parameterized Complexity -- Algorithmic Game Theory -- Algorithmic trading -- Competitive analysis -- Computational Advertising -- Computational finance -- Geometric problems -- Mechanism Design. . | |
520 | _aThis book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019. The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 submissions. Topics of interest for WAOA 2018 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications. | ||
650 | 0 |
_aMathematics _xData processing. |
|
650 | 0 | _aComputer engineering. | |
650 | 0 | _aComputer networks . | |
650 | 0 | _aApplication software. | |
650 | 0 | _aComputer science. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 1 | 4 | _aComputational Mathematics and Numerical Analysis. |
650 | 2 | 4 | _aComputer Engineering and Networks. |
650 | 2 | 4 | _aComputer and Information Systems Applications. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
700 | 1 |
_aBampis, Evripidis. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aMegow, Nicole. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030394783 |
776 | 0 | 8 |
_iPrinted edition: _z9783030394806 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v11926 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-39479-0 |
912 | _aZDB-2-SMA | ||
912 | _aZDB-2-SXMS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c174411 _d174411 |