東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Approximation and online algorithms ...

WAOA (Workshop) (2024 :)

FindBook

Google Book

Amazon

博客來

Approximation and online algorithms = 22nd International Workshop, WAOA 2024, Egham, UK, September 5-6, 2024 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Approximation and online algorithms/ edited by Marcin Bieńkowski, Matthias Englert.
其他題名:	22nd International Workshop, WAOA 2024, Egham, UK, September 5-6, 2024 : proceedings /
其他題名:	WAOA 2024
其他作者:	Bieńkowski, Marcin.
團體作者:	WAOA (Workshop)
出版者:	Cham :Springer Nature Switzerland : : 2025.,
面頁冊數:	xii, 229 p. :ill., digital ;24 cm.
內容註:	Bounding the price-of-fair-sharing using knapsack-cover constraints to guide near-optimal cost-recovery algorithms. -- Improved online scheduling with restarts on a single machine. -- Searching in Euclidean Spaces with Predictions. -- Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths. -- Approximating delta-Covering. -- Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching. -- Approximation Algorithms for k-Scenario Matching. -- Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees. -- Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line. -- Maximizing Throughput for Parallel Jobs with Speed-up Curves. -- Improved approximation algorithms for covering pliable set families and flexible graph connectivity. -- Small additive error for unsplittable multicommodity flow in outerplanar graphs. -- Complexity of Fixed Order Routing. -- Approximate Min-Sum Subset Convolution. -- Online String Attractors.
Contained By:	Springer Nature eBook
標題:	Approximation algorithms - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-031-81396-2
ISBN:	9783031813962

Approximation and online algorithms = 22nd International Workshop, WAOA 2024, Egham, UK, September 5-6, 2024 : proceedings /
Approximation and online algorithms22nd International Workshop, WAOA 2024, Egham, UK, September 5-6, 2024 : proceedings /[electronic resource] :WAOA 2024edited by Marcin Bieńkowski, Matthias Englert. - Cham :Springer Nature Switzerland :2025. - xii, 229 p. :ill., digital ;24 cm. - Lecture notes in computer science,152691611-3349 ;. - Lecture notes in computer science ;15269..

Bounding the price-of-fair-sharing using knapsack-cover constraints to guide near-optimal cost-recovery algorithms. -- Improved online scheduling with restarts on a single machine. -- Searching in Euclidean Spaces with Predictions. -- Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths. -- Approximating delta-Covering. -- Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching. -- Approximation Algorithms for k-Scenario Matching. -- Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees. -- Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line. -- Maximizing Throughput for Parallel Jobs with Speed-up Curves. -- Improved approximation algorithms for covering pliable set families and flexible graph connectivity. -- Small additive error for unsplittable multicommodity flow in outerplanar graphs. -- Complexity of Fixed Order Routing. -- Approximate Min-Sum Subset Convolution. -- Online String Attractors.

This book constitutes the refereed proceedings of the 22nd International Workshop on Approximation and Online Algorithms, WAOA 2024, held in Egham, UK, during September 5-6, 2024. The 15 full papers included in this book were carefully reviewed and selected from 47 submissions. They were organized in topical sections as follows: 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 designing and analyzing approximation and online algorithms, resource augmentation, and scheduling problems.

ISBN: 9783031813962

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

3220303
Approximation algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Approximation and online algorithms = 22nd International Workshop, WAOA 2024, Egham, UK, September 5-6, 2024 : proceedings /
LDR:02938nmm a2200349 a 4500 001 2408711
003 DE-He213
005 20250212115254.0
006 m d
007 cr nn 008maaau
008 260204s2025 sz s 0 eng d
020 $a 9783031813962 $q (electronic bk.)
020 $a 9783031813955 $q (paper)
024 7 $a 10.1007/978-3-031-81396-2 $2 doi
035 $a 978-3-031-81396-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 MAT041000 $2 bisacsh
072 7 $a PBKS $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b W251 2024
111 2 $a WAOA (Workshop) $n (22nd : $d 2024 : $c Egham, England) $3 3781434
245 1 0 $a Approximation and online algorithms $h [electronic resource] : $b 22nd International Workshop, WAOA 2024, Egham, UK, September 5-6, 2024 : proceedings / $c edited by Marcin Bieńkowski, Matthias Englert.
246 3 $a WAOA 2024
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a xii, 229 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 1611-3349 ; $v 15269
505 0 $a Bounding the price-of-fair-sharing using knapsack-cover constraints to guide near-optimal cost-recovery algorithms. -- Improved online scheduling with restarts on a single machine. -- Searching in Euclidean Spaces with Predictions. -- Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths. -- Approximating delta-Covering. -- Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching. -- Approximation Algorithms for k-Scenario Matching. -- Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees. -- Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line. -- Maximizing Throughput for Parallel Jobs with Speed-up Curves. -- Improved approximation algorithms for covering pliable set families and flexible graph connectivity. -- Small additive error for unsplittable multicommodity flow in outerplanar graphs. -- Complexity of Fixed Order Routing. -- Approximate Min-Sum Subset Convolution. -- Online String Attractors.
520 $a This book constitutes the refereed proceedings of the 22nd International Workshop on Approximation and Online Algorithms, WAOA 2024, held in Egham, UK, during September 5-6, 2024. The 15 full papers included in this book were carefully reviewed and selected from 47 submissions. They were organized in topical sections as follows: 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 designing and analyzing approximation and online algorithms, resource augmentation, and scheduling problems.
650 0 $a Approximation algorithms $v Congresses. $3 3220303
650 0 $a Online algorithms $v Congresses. $3 849492
650 1 4 $a Computational Mathematics and Numerical Analysis. $3 891040
650 2 4 $a Data Structures and Information Theory. $3 3382368
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Symbolic and Algebraic Manipulation. $3 891222
650 2 4 $a Numerical Analysis. $3 892626
650 2 4 $a Design and Analysis of Algorithms. $3 3538532
700 1 $a Bieńkowski, Marcin. $3 3781435
700 1 $a Englert, Matthias. $3 3781436
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 15269. $3 3781437
856 4 0 $u https://doi.org/10.1007/978-3-031-81396-2
950 $a Computer Science (SpringerNature-11645)