000 | 03638nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-031-18367-6 | ||
003 | DE-He213 | ||
005 | 20240423125100.0 | ||
007 | cr nn 008mamaa | ||
008 | 221020s2022 sz | s |||| 0|eng d | ||
020 |
_a9783031183676 _9978-3-031-18367-6 |
||
024 | 7 |
_a10.1007/978-3-031-18367-6 _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] : _b20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings / _cedited by Parinya Chalermsook, Bundit Laekhanukit. |
250 | _a1st ed. 2022. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2022. |
|
300 |
_aXI, 255 p. 34 illus., 19 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, _x1611-3349 ; _v13538 |
|
505 | 0 | _aLocating Service and Charging stations -- Graph burning and non-uniform $k$-centers for small treewidth -- Scheduling with Machine Conflicts -- Knapsack Secretary Through Boosting -- Scheduling Appointments Online: The Power of Deferred Decision-Making -- Canadian Traveller Problem with Predictions -- The Power of Amortized Recourse for Online Graph Problems- An Improved Algorithm for Open Online Dial-a-Ride -- Stochastic graph exploration with limited resources -- Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem -- On Streaming Algorithms for Geometric Independent Set and Clique -- Approximating Length-Restricted Means under Dynamic Time Warping. | |
520 | _aThis book constitutes revised selected papers from the thoroughly refereed workshop proceedings of the 20th International Workshop on Approximation and Online Algorithms, WAOA 2022, which was colocated with ALGO 2022 and took place in Potsdam, Germany, in September 2022. The 12 papers included in these proceedings were carefully reviewed and selected from 21 submissions. They focus on topics such as graph algorithms, network design, algorithmic game theory, approximation and online algorithms, etc. | ||
650 | 0 |
_aMathematics _xData processing. |
|
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aInformation theory. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aNumerical analysis. | |
650 | 0 | _aAlgorithms. | |
650 | 1 | 4 | _aComputational Mathematics and Numerical Analysis. |
650 | 2 | 4 | _aData Structures and Information Theory. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aNumerical Analysis. |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
650 | 2 | 4 | _aDesign and Analysis of Algorithms. |
700 | 1 |
_aChalermsook, Parinya. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aLaekhanukit, Bundit. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783031183669 |
776 | 0 | 8 |
_iPrinted edition: _z9783031183683 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v13538 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-18367-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c174033 _d174033 |