000			02110nam a2200481 a 4500
005			20250918123534.0
006			m d
007			cr nn 008maaau
008			101130s2009 gw j eng d
020			_a9783642036859 (electronic bk.)
020			_a9783642036842 (paper)
035			_a(Springer)978-3-642-03684-2
039		9	_y11-30-2010 _zmuhaimin
050	0	4	_aQA75.5 _b.I643 2009
082	0	4	_a004.015114 _222
090			_aQA75.5 _b.I61 2009
111	2		_aInternational Workshop on Approximation Algorithms for Combinatorial Optimization Problems _n(12th : _d2009 : _cBerkeley, Calif.)
245	1	0	_aApproximation, randomization, and combinatorial optimization _h[electronic resource] : _balgorithms and techniques : 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009 : proceedings / _cedited by Irit Dinur ... [et al.].
246	3	0	_aAPPROX 2009
246	3	0	_aRANDOM 2009
260			_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2009.
300			_axii, 740 p. : _bill., digital ; _c24 cm.
440		0	_aLecture notes in computer science, _x0302-9743 ; _v5687
650		0	_aComputer science _xStatistical methods _vCongresses.
650		0	_aComputer algorithms _vCongresses.
650	2	4	_aNumeric Computing.
650	2	4	_aProbability and Statistics in Computer Science.
650	2	4	_aSymbolic and Algebraic Manipulation.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	1	4	_aComputer Science.
650	2	4	_aCoding and Information Theory.
700	1		_aDinur, Irit.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
856	4	0	_uhttps://eresourcesptsl.ukm.remotexs.co/user/login?url=http://dx.doi.org/10.1007/978-3-642-03685-9
907			_a.b1484901x _b2024-03-21 _c2019-11-12
942			_n0 _kQA75.5 .I61 2009
914			_avtls003446323
998			_ae0001 _b2010-04-11 _cm _da _feng _ggw _y0 _z.b1484901x
999			_c471523 _d471523