Lecture Notes in Computer Science16077 Approximation and Online Algorithms

Name: Lecture Notes in Computer Science16077 Approximation and Online Algorithms
SKU: 5ff7c62f358fdaa34d26797b0c316395
Price: 54.99 EUR
Availability: InStock

1/1

Afbeelding van Lecture Notes in Computer Science16077 Approximation and Online Algorithms

Bol

Prijzen vanaf

54,99

Uitgelicht

	54,99	Naar shop
VERGELIJK ALLE AANBIEDERS (1)

Beschrijving

Bol This book constitutes the refereed proceedings of the 23rd International Workshop on Approximation and Online Algorithms, WAOA 2025, held in Warsaw, Poland, during September 18–19, 2025. The 15 full papers included in this book were carefully reviewed and selected from 43 submissions. WAOA 2025 invited submissions on topics related to approximation and online algorithms, including algorithmic game theory, coloring and partitioning,computational economics and mechanism design, experimental methods for approximation and online algorithms, FPT-approximation algorithms, geometric problems, graph algorithms and network design, inapproximability results, packing and covering, matroids and submodular functions, new paradigms in approximation and online optimization, online selection problems, resource augmentation, relaxations and tightness of formulations, robust and stochastic problems,and scheduling problems.

Lees meer

Vergelijk aanbieders (1)

Sorteren op:

€ 54,99 Gratis verzending

Beschrijving (1)

This book constitutes the refereed proceedings of the 23rd International Workshop on Approximation and Online Algorithms, WAOA 2025, held in Warsaw, Poland, during September 18–19, 2025. The 15 full papers included in this book were carefully reviewed and selected from 43 submissions. WAOA 2025 invited submissions on topics related to approximation and online algorithms, including algorithmic game theory, coloring and partitioning,computational economics and mechanism design, experimental methods for approximation and online algorithms, FPT-approximation algorithms, geometric problems, graph algorithms and network design, inapproximability results, packing and covering, matroids and submodular functions, new paradigms in approximation and online optimization, online selection problems, resource augmentation, relaxations and tightness of formulations, robust and stochastic problems,and scheduling problems.

Lees meer