000 | 03776nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-319-89441-6 | ||
003 | DE-He213 | ||
005 | 20240730174414.0 | ||
007 | cr nn 008mamaa | ||
008 | 180330s2018 sz | s |||| 0|eng d | ||
020 |
_a9783319894416 _9978-3-319-89441-6 |
||
024 | 7 |
_a10.1007/978-3-319-89441-6 _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] : _b15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers / _cedited by Roberto Solis-Oba, Rudolf Fleischer. |
250 | _a1st ed. 2018. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2018. |
|
300 |
_aX, 329 p. 42 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 ; _v10787 |
|
505 | 0 | _aGraph 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 -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Mechanism design -- Resource augmentation -- Real-world applications. | |
520 | _aThis book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017. The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 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; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications. | ||
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aNumerical analysis. _94603 |
|
650 | 0 |
_aArtificial intelligence _xData processing. _921787 |
|
650 | 0 |
_aComputer networks . _931572 |
|
650 | 0 |
_aComputer graphics. _94088 |
|
650 | 1 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aNumerical Analysis. _94603 |
650 | 2 | 4 |
_aData Science. _934092 |
650 | 2 | 4 |
_aComputer Communication Networks. _9112349 |
650 | 2 | 4 |
_aComputer Graphics. _94088 |
700 | 1 |
_aSolis-Oba, Roberto. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9112350 |
|
700 | 1 |
_aFleischer, Rudolf. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9112351 |
|
710 | 2 |
_aSpringerLink (Online service) _9112352 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783319894409 |
776 | 0 | 8 |
_iPrinted edition: _z9783319894423 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v10787 _9112353 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-319-89441-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c89412 _d89412 |