Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	Februar 2016
Genre:	Schulbücher
	algorithmanalysis / algorithmanalysisandproblemcomplexity / Algorithmen und Datenstrukturen / Algorithms / Algorithmus / approximationalgorithms / coloring / competitiveanalysis / Datenbanken / Datenmanagement / designandanalysisofalgorithms / discretemathematicsincomputerscience / Diskrete Mathematik / Fixed-parametertractablealgorithm / Geometricproblems / Mathematik / Mathematik für Informatiker / Networkdesign / numericcomputing / onlinealgorithms / OnlineScheduling / PackingandCovering / parameterizedcomplexity / problemcomplexity / Randominput / Randomizationtechniques / Temporalconnectivity / Temporalgraphs mehr...
ISBN:	9783319286839
EAN-Code:	9783319286839
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Serie:	#9499 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D 13 mm
Gewicht:	341 gr
Seiten:	220
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015. The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems,and real-world applications.