000			03123nam a22005655i 4500
001			978-3-642-29116-6
003			DE-He213
005			20160624102210.0
007			cr nn 008mamaa
008			120326s2012 gw | s |||| 0|eng d
020			_a9783642291166 _9978-3-642-29116-6
024	7		_a10.1007/978-3-642-29116-6 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _223
245	1	0	_aApproximation and Online Algorithms _h[electronic resource] : _b9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers / _cedited by Roberto Solis-Oba, Giuseppe Persiano.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2012.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2012.
300			_aX, 278 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v7164
520			_aThis 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.
650		0	_aComputer science.
650		0	_aComputer software.
650		0	_aElectronic data processing.
650		0	_aComputational complexity.
650		0	_aComputer graphics.
650		0	_aAlgorithms.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aNumeric Computing.
650	2	4	_aComputer Graphics.
650	2	4	_aInformation Systems Applications (incl. Internet).
650	2	4	_aAlgorithms.
700	1		_aSolis-Oba, Roberto. _eeditor.
700	1		_aPersiano, Giuseppe. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642291159
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v7164
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-29116-6
942			_2EBK10178 _cEBK
999			_c39472 _d39472