De Aller-Bedste Bøger - over 12 mio. danske og engelske bøger
Levering: 1 - 2 hverdage

Approximation and Online Algorithms

Bag om Approximation and Online Algorithms

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

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9783031498145
  • Indbinding:
  • Paperback
  • Sideantal:
  • 248
  • Udgivet:
  • 22. December 2023
  • Udgave:
  • 23001
  • Størrelse:
  • 155x14x235 mm.
  • Vægt:
  • 382 g.
  • 2-3 uger.
  • 8. Oktober 2024
På lager

Normalpris

Abonnementspris

- Rabat på køb af fysiske bøger
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding

Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.

Beskrivelse af Approximation and Online Algorithms

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

Brugerbedømmelser af Approximation and Online Algorithms