Cantitate/Preț
Produs
Total produse
Vezi coșul
Approximation and Online Algorithms: 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7–8, 2023, Proceedings de Jarosław Byrka

Approximation and Online Algorithms: 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7–8, 2023, Proceedings: Lecture Notes in Computer Science, cartea 14297

Editat de Jarosław Byrka, Andreas Wiese
en Limba Engleză Paperback – 22 dec 2023
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

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 44276 lei

Nou

Puncte Express: 664
Preț estimativ în valută:
8487€ • 8908$ • 69100£

Carte tipărită la comandă

Livrare economică 23 ianuarie-06 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031498145
ISBN-10: 3031498143
Pagini: 236
Ilustrații: XII, 236 p. 35 illus., 13 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.35 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.