000			01832nam a22005175i 4500
001			978-3-540-32213-9
003			DE-He213
005			20130515021403.0
007			cr nn 008mamaa
008			100714s2006 gw | s |||| 0|eng d
020			_a9783540322139 _9978-3-540-32213-9
024	7		_a10.1007/11671541 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _223
100	1		_aBampis, Evripidis.
245	1	0	_aEfficient Approximation and Online Algorithms _h[electronic resource] : _bRecent Progress on Classical Combinatorial Optimization Problems and New Applications / _cedited by Evripidis Bampis, Klaus Jansen, Claire Kenyon.
260			_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2006.
300			_bdigital.
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v3484
650		0	_aComputer science.
650		0	_aComputer Communication Networks.
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 Communication Networks.
650	2	4	_aComputer Graphics.
650	2	4	_aAlgorithms.
700	1		_aJansen, Klaus.
700	1		_aKenyon, Claire.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540322122
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v3484
856	4	0	_uhttp://dx.doi.org/10.1007/11671541
912			_aZDB-2-SCS
912			_aZDB-2-LNC
999			_c76772 _d76772