Approximation and Online Algorithms
☆☆☆☆☆
(0 reviews)
EAN: 9783030927011
Lowest price (incl. delivery)
8 322,00 JPY
- Typical price
- 460,79 PLN
- Lowest (90 days)
- 26,93 PLN
- Offers
- 6
- Last updated
- 2 bulan yang lalu
Price history (90 days)
Full history
2026-08-05
2026-08-15
| Diperbarui Pada | Harga |
|---|---|
| 2026-08-05 | 67,28 |
| 2026-08-08 | 26,93 |
| 2026-08-15 | 57,99 |
| Penjual | Product price | Delivery | Total | Ketersediaan | Updated | |
|---|---|---|---|---|---|---|
| SpringerNatureLink Shop INT | Product price 8 293,00 JPY ▲ 14 200,7% | Delivery 29,00 JPY | Total 8 322,00 JPY | Ketersediaan Tersedia | Updated 2 bulan yang lalu | View offer |
| SpringerNatureLink Shop INT | Product price 57,99 USD | Delivery 29,00 USD | Total 86,99 USD | Ketersediaan Tersedia | Updated 2 bulan yang lalu | View offer |
| SpringerNatureLink Shop INT | Product price 68,50 EUR ▲ 7,4% | Delivery 25,00 EUR | Total 93,50 EUR | Ketersediaan Tersedia | Updated 2 bulan yang lalu | View offer |
| Springer Nature Author | Product price 68,50 EUR ▲ 7,4% | Delivery 25,00 EUR | Total 93,50 EUR | Ketersediaan Tersedia | Updated 2 bulan yang lalu | View offer |
| OnBuy.com | Product price 67,28 GBP | Delivery free | Total 67,28 GBP | Ketersediaan Tersedia | Updated 2 bulan yang lalu | View offer |
| VitalSource | Product price 370,01 ZAR ▲ 506,8% | Delivery 15,00 ZAR | Total 385,01 ZAR | Ketersediaan Tersedia | Updated 2 bulan yang lalu | View offer |
Harga dan ketersediaan dapat berubah. Terakhir Diperbarui: 08.08.2026 05:58.
EAN
9783030927011
Springer Nature
0,0
☆☆☆☆☆
0 reviews
5★
0%
4★
0%
3★
0%
2★
0%
1★
0%
Product reviews
No reviews yet — be the first!
This book constitutes the thoroughly refereed workshop post-proceedings of the 19th International Workshop on Approximation and Online Algorithms, WAOA 2021, held in September 2021. Due to COVID-19 pandemic the conference was held virtually. The 16 revised full papers presented in this book were carefully reviewed and selected from 31 submissions. The papers focus on the design and analysis of algorithms for online and computationally hard problems.