000			01992nam a22005175i 4500
001			978-3-642-22935-0
003			DE-He213
005			20130515022235.0
007			cr nn 008mamaa
008			110812s2011 gw | s |||| 0|eng d
020			_a9783642229350 _9978-3-642-22935-0
024	7		_a10.1007/978-3-642-22935-0 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _223
100	1		_aGoldberg, Leslie Ann.
245	1	0	_aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques _h[electronic resource] : _b14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings / _cedited by Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim.
260			_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2011.
300			_bdigital.
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v6845
650		0	_aComputer science.
650		0	_aComputer Communication Networks.
650		0	_aData structures (Computer science).
650		0	_aComputer software.
650		0	_aComputational complexity.
650		0	_aComputer graphics.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aData Structures.
650	2	4	_aComputation by Abstract Devices.
650	2	4	_aComputer Graphics.
650	2	4	_aComputer Communication Networks.
700	1		_aJansen, Klaus.
700	1		_aRavi, R.
700	1		_aRolim, José D. P.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642229343
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v6845
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-22935-0
912			_aZDB-2-SCS
912			_aZDB-2-LNC
999			_c85493 _d85493