Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	Oktober 2025
Genre:	Schulbücher
	Algorithmen und Datenstrukturen / algorithmic game theory / Coloring and partitioning / Computational economics and mechanism design / Computational Mathematics and Numerical Analysis / Data Structures and Information Theory / Design and Analysis of Algorithms / Discrete Mathematics in Computer Science / Diskrete Mathematik / Experimental methods for approximation and online algorithms / FPT-approximation algorithms / geometric problems / Graph algorithms and network design / Inapproximability results / Informationstheorie / Mathematik für Informatiker / Matroids and submodular functions / New paradigms in approximation and online optimization / Numerical analysis / Online selection problems / Packing and covering / Relaxations and tightness of formulations / Resource augmentation / Robust and stochastic problems / Scheduling problems / Symbolic and Algebraic Manipulation / Theoretische Informatik mehr...
ISBN:	9783032067050
EAN-Code:	9783032067050
Verlag:	Springer International Publishing
Einband:	Kartoniert
Sprache:	English
Dimensionen:	H 235 mm / B 155 mm / D
Seiten:	229
Illustration:	XIV, 229 p. 29 illus., 22 illus. in color., schwarz-weiss Illustrationen, farbige Illustrationen
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

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.