Besplatna dostava putem Box Now paketomata i Overseas kurirske službe iznad 69,99 €.

Provjerite status narudžbe

Pridružite se zajednici ljubitelja knjige iz cijelog svijeta i ostvarite mnoštvo pogodnosti. Izradite besplatni račun

Besplatna dostava Overseas kurirskom službom iznad 69.99 €

DPD kurir 3.99 € DPD točka 3.49 € GLS Kurir 4.99 € GLS paketomat 3.99 € Hrvatska pošta 4.99 € Dostava Overseas 4.99 € Box Now 4.49 €

Kontakt

Kako kupovati

Pomoć

Moj račun

▸ Prazno :-(

Besplatna dostava putem Box Now paketomata i Overseas kurirske službe iznad 69,99 €.

Approximation and Online Algorithms

Name: Approximation and Online Algorithms
Brand: Springer-Verlag GmbH
SKU: 49511680
Price: 59.7 EUR
Availability: InStock
Author: José Verschae
ISBN: 9783032067050

José Verschae

Jezik

Engleski

Knjiga Meki uvez

Libristo kod: 49511680

Nakladnici Springer-Verlag GmbH, prosinac 2025

This book constitutes the refereed proceedings of the 23rd International Workshop on Approximation a... Cijeli opis

Libristo kod: 49511680

145 b

59.70 €

Vanjske zalihe Šaljemo za 5-8 dana

Do 30 dana za povrat

Kupci su kupili i

Son Espionne royale et les douze crimes de Noël - tome 6 Rhys Bowen

Meki uvez

18.55 €

Marxistische Wirtschaftstheorie. Bd.1 Ernest Mandel

Meki uvez

21.47 €

FURY BOUND (Wolves of Ruin, Band 2) Julia Schwenk

Tvrdi uvez

21.58 €

Shakespeares Sonetter & Själens Speglingar av Dr. Peter Fogarty Peter Fogarty

Meki uvez

14.82 €

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.