Pricelists.org Pricelists.org Autentificare Înregistrează-te

Approximation and Online Algorithms

☆☆☆☆☆ (0 reviews)
Show price history
Approximation and Online Algorithms
Lowest price (incl. delivery)
8 293,00 JPY
Typical price509,71 PLN
Lowest (90 days)17,10 PLN
Offers5
Last updated1 săptămână în urmă
See best offer
Price history (90 days)
Full history
2026-08-07 2026-08-15
Istoricul prețurilor
Actualizat laPreț
2026-08-0717,10
2026-08-0826,93
2026-08-1557,99
Vânzător Product price Delivery Total Disponibilitate Updated
SP SpringerNatureLink Shop INT 8 293,00 JPY free 8 293,00 JPY Disponibil 5 zile în urmă View offer
SP SpringerNatureLink Shop INT 57,99 USD 25,00 USD 82,99 USD Disponibil 5 zile în urmă View offer
SP SpringerNatureLink Shop INT 63,79 EUR 25,00 EUR 88,79 EUR Disponibil 5 zile în urmă View offer
SP Springer Nature Author 68,50 EUR 29,00 EUR 97,50 EUR Disponibil 1 săptămână în urmă View offer
VI VitalSource 370,01 ZAR free 370,01 ZAR Disponibil 1 săptămână în urmă View offer

Prețurile și disponibilitatea se pot modifica. Ultima actualizare: 08.08.2026 05:58.

EAN 9783032067050
Springer Nature
0,0
☆☆☆☆☆
0 reviews
5★ 0%
4★ 0%
3★ 0%
2★ 0%
1★ 0%

Product reviews

Rating
No reviews yet — be the first!
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.

Similar products