國立虎尾科技大學 |

Approximation and online algorithms = 21st International Workshop, WAOA 2023, Amsterdam, the Netherlands, September 7-8, 2023 : proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Approximation and online algorithms/ edited by Jaroslaw Byrka, Andreas Wiese.
其他題名:	21st International Workshop, WAOA 2023, Amsterdam, the Netherlands, September 7-8, 2023 : proceedings /
其他題名:	WAOA 2023
其他作者:	Wiese, Andreas.
團體作者:	Workshop on the Preservation of Stability under Discretization
出版者:	Cham :Springer Nature Switzerland : : 2023.,
面頁冊數:	xii, 236 p. :ill., digital ; : 24 cm.;
Contained By:	Springer Nature eBook
標題:	Design and Analysis of Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-031-49815-2
ISBN:	9783031498152

Approximation and online algorithms = 21st International Workshop, WAOA 2023, Amsterdam, the Netherlands, September 7-8, 2023 : proceedings /
Approximation and online algorithms21st International Workshop, WAOA 2023, Amsterdam, the Netherlands, September 7-8, 2023 : proceedings /[electronic resource] :WAOA 2023edited by Jaroslaw Byrka, Andreas Wiese. - Cham :Springer Nature Switzerland :2023. - xii, 236 p. :ill., digital ;24 cm. - Lecture notes in computer science,142970302-9743 ;. - Lecture notes in computer science ;6140..

Optimization under Explorable Uncertainty: Adversarial and Stochastic Models -- Approximation Ineffectiveness of a Tour-Untangling Heuristic -- A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities -- Approximating Maximum Edge 2-Coloring by Normalizing Graphs -- An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem -- Greedy Minimum-Energy Scheduling -- Scheduling with Speed Predictions -- The Power of Amortization on Scheduling with Explorable Uncertainty -- Total Completion Time Scheduling Under Scenarios -- Approximating Fair k-Min-Sum-Radii in Euclidean Space -- Online hitting set of d-dimensional fat objects -- Approximation Schemes under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes -- Hitting Sets when the Shallow Cell Complexity is Small -- Any-Order Online Interval Selection -- Improved Approximations for Relative Survivable Network Design -- Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations -- Fast Parallel Algorithms for Submodular p-Superseparable Maximization.

This book constitutes the refereed proceedings of the 21st International Workshop on Approximation and Online Algorithms, WAOA 2023, held in Amsterdam, The Netherlands, during September 7-8, 2023 The 16 full papers included in this book are carefully reviewed and selected from 43 submissions. The topics of WAOA 2023 were algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT-approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, resource augmentation, and scheduling problems.

ISBN: 9783031498152

Standard No.: 10.1007/978-3-031-49815-2doiSubjects--Topical Terms:

1365721
Design and Analysis of Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Approximation and online algorithms = 21st International Workshop, WAOA 2023, Amsterdam, the Netherlands, September 7-8, 2023 : proceedings /
LDR:03093nam a2200349 a 4500 001 1120220
003 DE-He213
005 20231221073537.0
006 m d
007 cr nn 008maaau
008 240612s2023 sz s 0 eng d
020 $a 9783031498152 $q (electronic bk.)
020 $a 9783031498145 $q (paper)
024 7 $a 10.1007/978-3-031-49815-2 $2 doi
035 $a 978-3-031-49815-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a PBKS $2 bicssc
072 7 $a MAT006000 $2 bisacsh
072 7 $a PBKS $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b W251 2023
111 2 $a Workshop on the Preservation of Stability under Discretization $d (2001 : $c Fort Collins, Colo.) $3 527686
245 1 0 $a Approximation and online algorithms $h [electronic resource] : $b 21st International Workshop, WAOA 2023, Amsterdam, the Netherlands, September 7-8, 2023 : proceedings / $c edited by Jaroslaw Byrka, Andreas Wiese.
246 3 $a WAOA 2023
260 $a Cham : $c 2023. $b Springer Nature Switzerland : $b Imprint: Springer,
300 $a xii, 236 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 14297
505 0 $a Optimization under Explorable Uncertainty: Adversarial and Stochastic Models -- Approximation Ineffectiveness of a Tour-Untangling Heuristic -- A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities -- Approximating Maximum Edge 2-Coloring by Normalizing Graphs -- An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem -- Greedy Minimum-Energy Scheduling -- Scheduling with Speed Predictions -- The Power of Amortization on Scheduling with Explorable Uncertainty -- Total Completion Time Scheduling Under Scenarios -- Approximating Fair k-Min-Sum-Radii in Euclidean Space -- Online hitting set of d-dimensional fat objects -- Approximation Schemes under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes -- Hitting Sets when the Shallow Cell Complexity is Small -- Any-Order Online Interval Selection -- Improved Approximations for Relative Survivable Network Design -- Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations -- Fast Parallel Algorithms for Submodular p-Superseparable Maximization.
520 $a This book constitutes the refereed proceedings of the 21st International Workshop on Approximation and Online Algorithms, WAOA 2023, held in Amsterdam, The Netherlands, during September 7-8, 2023 The 16 full papers included in this book are carefully reviewed and selected from 43 submissions. The topics of WAOA 2023 were algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, FPT-approximation algorithms, geometric problems, graph algorithms, inapproximability results, mechanism design, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, resource augmentation, and scheduling problems.
650 2 4 $a Design and Analysis of Algorithms. $3 1365721
650 2 4 $a Numerical Analysis. $3 671433
650 2 4 $a Symbolic and Algebraic Manipulation. $3 669944
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 Online algorithms $v Congresses. $3 674690 $3 733604
650 0 $a Approximation algorithms $v Congresses. $3 784360
700 1 $a Wiese, Andreas. $e editor. $3 1314912
700 1 $a Byrka, Jaroslaw. $3 1435356
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 6140. $3 744199
856 4 0 $u https://doi.org/10.1007/978-3-031-49815-2
950 $a Computer Science (SpringerNature-11645)