Doprava zdarma pre objednávky nad 59,99 € s Packetou a SPS Boxmi.

Zistiť stav objednávky

Staňte sa súčasťou komunity milovníkov kníh z celého sveta a získajte hromadu výhod. Založiť účet zdarma

Doprava zadarmo s Packetou nad 59.99 €

Kuriér DPD 2.99 € Zberné miesto GLS 2.99 € SPS 3.99 € Kuriér GLS 3.49 € SPS Parcel Shop 2.99 € Packeta kurýr 3.99 € Pošta 3.99 € Zberné miesto DPD 2.99 € Zberné miesto DPD 0.00 € Packeta 2.99 €

Kontakt

Ako nakupovať

Pomoc

Môj účet

▸ Prázdny :-(

Doprava zdarma pre objednávky nad 59,99 € s Packetou a SPS Boxmi.

Approximation and Online Algorithms

Name: Approximation and Online Algorithms
Brand: Springer
SKU: 49868063
Price: 66.74 EUR
Availability: InStock
Author: Jannik Matuschke
ISBN: 9783032067067

23rd International Workshop, WAOA 2025, Warsaw, Poland, September 18-19, 2025, Proceedings

Jannik Matuschke

Jose Verschae

Jazyk

Angličtina

E-kniha Adobe ePub DRM

Nakladateľstvo Springer, september 2025

This book constitutes the refereed proceedings of the 23rd International Workshop on Approximation a... Celý popis

Libristo kód: 49868063

161 b

66.74 €

Skladom Ihneď na stiahnutie

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.