000			01851cam a2200325Ia 4500
001			u2778
003			SA-PMU
005			20210418122922.0
008			030225s2003 gw a b 001 0 eng d
010			_a 2001042005
040			_aSZR _beng _cSZR _dGZM _dUBA _dLVB _dPUL _dDEBSZ _dHEBIS _dDEBBG _dOCL
020			_a3540653678 (alk. paper)
020			_a9783540653677 (alk. paper)
035			_a(OCoLC)51739251
050		4	_aQA76.9.A43 _bV39 2003
082	0	4	_a511.8 _221
100	1		_aVazirani, Vijay V.
245	1	0	_aApproximation algorithms / _cVijay V. Vazirani.
250			_aCorr. 2nd print.
260			_aBerlin ; _aNew York : _bSpringer, _cc2003.
300			_axix, 380 p. : _bill. ; _c25 cm.
504			_aIncludes bibliographical references (p. [357]-372) and index.
505	0		_aCombinatorial algorithms -- Set cover -- Steiner tree and TSP -- Multiway cut and k-cut -- k-center -- Feedback vertex set -- Shortest superstring -- Knapsack -- Bin packing -- Minimum makespan scheduling -- Euclidean TSP -- LP-based algorithms -- Introduction to LP-Duality -- Set cover via dual fitting -- Rounding applied to set cover -- Set cover via the primal-dual schema -- Maximum satisfiability -- Scheduling on unrelated parallel machines -- Multicut and integer multicommodity flow in trees -- Multiway cut -- Multicut in general graphs -- Sparsest cut -- Steiner forest -- Steiner network -- Facility location -- k-median -- Semidefinite programming -- Other topics -- Shortest vector -- Counting problems -- Hardness of approximation -- Open problems -- An overview of complexity theory for the algorithm designer -- Basic facts from probability theory.
650		0	_aComputer algorithms.
650		0	_aMathematical optimization.
942			_cBOOK
994			_aZ0 _bSUPMU
948			_hNO HOLDINGS IN SUPMU - 96 OTHER HOLDINGS
596			_a1 2
999			_c562 _d562