Approximation and Online Algorithms 22nd International Workshop, WAOA 2024, Egham, UK, September 5–6, 2024, Proceedings /
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 i...
Sparad:
| Institutionell upphovsman: | |
|---|---|
| Övriga upphovsmän: | , |
| Materialtyp: | Elektronisk E-bok |
| Språk: | engelska |
| Publicerad: |
Cham :
Springer Nature Switzerland : Imprint: Springer,
2025.
|
| Upplaga: | 1st ed. 2025. |
| Serie: | Lecture Notes in Computer Science,
15269 |
| Ämnen: | |
| Länkar: | https://doi.org/10.1007/978-3-031-81396-2 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-81396-2 | ||
| 003 | DE-He213 | ||
| 005 | 20260706115729.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 250212s2025 sz | s |||| 0|eng d | ||
| 020 | |a 9783031813962 |9 978-3-031-81396-2 | ||
| 024 | 7 | |a 10.1007/978-3-031-81396-2 |2 doi | |
| 050 | 4 | |a QA71-90 | |
| 072 | 7 | |a PBKS |2 bicssc | |
| 072 | 7 | |a MAT041000 |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 22nd International Workshop, WAOA 2024, Egham, UK, September 5–6, 2024, Proceedings / |c edited by Marcin Bieńkowski, Matthias Englert. |
| 250 | |a 1st ed. 2025. | ||
| 264 | 1 | |a Cham : |b Springer Nature Switzerland : |b Imprint: Springer, |c 2025. | |
| 300 | |a XII, 229 p. 35 illus., 24 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 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 Mathematics |x Data processing. | |
| 650 | 0 | |a Data structures (Computer science). | |
| 650 | 0 | |a Information theory. | |
| 650 | 0 | |a Computer science |x Mathematics. | |
| 650 | 0 | |a Discrete mathematics. | |
| 650 | 0 | |a Numerical analysis. | |
| 650 | 0 | |a Algorithms. | |
| 650 | 1 | 4 | |a Computational Mathematics and Numerical Analysis. |
| 650 | 2 | 4 | |a Data Structures and Information Theory. |
| 650 | 2 | 4 | |a Discrete Mathematics in Computer Science. |
| 650 | 2 | 4 | |a Symbolic and Algebraic Manipulation. |
| 650 | 2 | 4 | |a Numerical Analysis. |
| 650 | 2 | 4 | |a Design and Analysis of Algorithms. |
| 700 | 1 | |a Bieńkowski, Marcin. |e editor. |0 (orcid)0000-0002-2453-7772 |1 https://orcid.org/0000-0002-2453-7772 |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 700 | 1 | |a Englert, Matthias. |e editor. |0 (orcid)0000-0002-8859-7731 |1 https://orcid.org/0000-0002-8859-7731 |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783031813955 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031813979 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031813986 |
| 830 | 0 | |a Lecture Notes in Computer Science, |x 1611-3349 ; |v 15269 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-031-81396-2 |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 912 | |a ZDB-2-SXPS | ||
| 912 | |a ZDB-2-LNC | ||
| 912 | |a ZDB-2-251 | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||
| 950 | |a Springer Nature Proceedings Computer Science (SpringerNature-85344) | ||
| 950 | |a Focus Bundle Mathematics and Statistics (SpringerNature-85421) | ||