Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers

Gespeichert in:

Personen und Körperschaften:	Solis-Oba, Roberto (VerfasserIn), Persiano, Giuseppe (Sonstige)
Titel:	Approximation and Online Algorithms: 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers/ edited by Roberto Solis-Oba, Giuseppe Persiano
Format:	E-Book Konferenzbericht
Sprache:	Englisch
veröffentlicht:	Berlin, Heidelberg Springer Berlin Heidelberg 2012
Gesamtaufnahme:	SpringerLink Lecture notes in computer science ; 7164
Schlagwörter:	Computer software Electronic data processing Computational complexity Computer Science Computer science Computer graphics Algorithms Numerical analysis. Discrete mathematics. Application software. Konferenzschrift > 2011 > Saarbrücken
Buchausg. u.d.T.:	Approximation and online algorithms, Berlin : Springer, 2012, X, 273 S.
Quelle:	Verbunddaten SWB
Zugangsinformationen:	Elektronischer Volltext - Campuslizenz

Details
Zusammenfassung:	This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems.
Beschreibung:	Literaturangaben
Umfang:	Online-Ressource (X, 275p. 23 illus, digital)
ISBN:	9783642291166
DOI:	10.1007/978-3-642-29116-6