bokomslag Approximation and Online Algorithms
Data & IT

Approximation and Online Algorithms

Marcin Bie?Kowski Matthias Englert

Pocket

979:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 10-16 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 229 sidor
  • 2025
This book constitutes the refereed proceedings of the 22nd International WorkshoponApproximation 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.
  • Författare: Marcin Bie?Kowski, Matthias Englert
  • Format: Pocket/Paperback
  • ISBN: 9783031813955
  • Språk: Engelska
  • Antal sidor: 229
  • Utgivningsdatum: 2025-02-12
  • Förlag: Springer International Publishing AG