Image from Google Jackets

Approximation and Online Algorithms edited by Jarosław Byrka, Andreas Wiese. [electronic resource] :

Contributor(s): Material type: TextTextPublication details: Cham Springer Nature Switzerland 2023Edition: 1st ed. 2023Description: XII, 236 p. 35 illus., 13 illus. in color. online resourceISBN:
  • 9783031498152
Subject(s): DDC classification:
  • 518
Online resources: Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Home library Call number Status Notes Date due Barcode Item holds
e-Book e-Book S. R. Ranganathan Learning Hub Online Available Platform:Springer EB3004
Total holds: 0

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.

There are no comments on this title.

to post a comment.