000			01738aam a2200445 i 4500
005			20250914164842.0
006			m d
007			cr nn 008maaau
008			090212s2006 gw q j eng d
020			_a9783540322139 (electronic bk.)
035			_a(Springer)978-3-540-32212-2
039		9	_a200902121948 _bmuhaimin _y04-04-2008 _zmuhaimin
050	1	4	_aQA164 _b.E24 2006
082	0	4	_a005.1 _222
245	0	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-Verlag GmbH., _c2006
300			_avi, 347 p. : _bill., digital ; _c24 cm.
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v3484
650		0	_aCombinatorial optimization.
650		0	_aOnline algorithms.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aAlgorithms.
650	2	4	_aComputer Communication Networks.
650	2	4	_aComputer Graphics.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aNumeric Computing.
700	1		_aBampis, Evripidis.
700	1		_aJansen, Klaus.
700	1		_aKenyon, Claire.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer e-books
856	4	0	_uhttps://eresourcesptsl.ukm.remotexs.co/user/login?url=http://dx.doi.org/10.1007/11671541
907			_a.b14143033 _b2024-04-17 _c2019-11-12
942			_n0
914			_avtls003371867
998			_ae0001 _b2008-04-04 _cm _dz _feng _ggw _y0 _z.b14143033
999			_c410283 _d410283