國立虎尾科技大學 |

Approximation and Online Algorithms = 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Approximation and Online Algorithms/ edited by Parinya Chalermsook, Bundit Laekhanukit.
其他題名:	20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings /
其他作者:	Laekhanukit, Bundit.
面頁冊數:	XI, 255 p. 34 illus., 19 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Design and Analysis of Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-031-18367-6
ISBN:	9783031183676

Approximation and Online Algorithms = 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings /
Approximation and Online Algorithms20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings /[electronic resource] :edited by Parinya Chalermsook, Bundit Laekhanukit. - 1st ed. 2022. - XI, 255 p. 34 illus., 19 illus. in color.online resource. - Lecture Notes in Computer Science,135381611-3349 ;. - Lecture Notes in Computer Science,9324.

Locating 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.

This 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.

ISBN: 9783031183676

Standard No.: 10.1007/978-3-031-18367-6doiSubjects--Topical Terms:

1365721
Design and Analysis of Algorithms.

LC Class. No.: QA71-90

Dewey Class. No.: 518

Approximation and Online Algorithms = 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings /
LDR:02677nam a22004095i 4500 001 1084490
003 DE-He213
005 20221020172428.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031183676 $9 978-3-031-18367-6
024 7 $a 10.1007/978-3-031-18367-6 $2 doi
035 $a 978-3-031-18367-6
050 4 $a QA71-90
072 7 $a PBKS $2 bicssc
072 7 $a MAT006000 $2 bisacsh
072 7 $a PBKS $2 thema
082 0 4 $a 518 $2 23
245 1 0 $a Approximation and Online Algorithms $h [electronic resource] : $b 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings / $c edited by Parinya Chalermsook, Bundit Laekhanukit.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XI, 255 p. 34 illus., 19 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Lecture Notes in Computer Science, $x 1611-3349 ; $v 13538
505 0 $a Locating 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 $a This 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 2 4 $a Design and Analysis of Algorithms. $3 1365721
650 2 4 $a Symbolic and Algebraic Manipulation. $3 669944
650 2 4 $a Numerical Analysis. $3 671433
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 1 4 $a Computational Mathematics and Numerical Analysis. $3 669338
650 0 $a Algorithms. $3 527865
650 0 $a Numerical analysis. $3 527939
650 0 $a Discrete mathematics. $3 1254302
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Information theory. $3 595305
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Mathematics—Data processing. $3 1365953
700 1 $a Laekhanukit, Bundit. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1390789
700 1 $a Chalermsook, Parinya. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1390788
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031183669
776 0 8 $i Printed edition: $z 9783031183683
830 0 $a Lecture Notes in Computer Science, $x 0302-9743 ; $v 9324 $3 1258960
856 4 0 $u https://doi.org/10.1007/978-3-031-18367-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)