000			03219cam a22003734a 4500
001			16633761
005			20170821123937.0
008			110202s2011 enka b 001 0 eng
010			_a 2011003653
020			_a9780521189439
035			_a(OCoLC)ocn694393831
040			_aDLC _cDLC _dYDX _dBTCTA _dYDXCP _dBWX _dCDX _dDLC
042			_apcc
050	0	0	_aQA297.8 _b.L38 2011
082	0	0	_a518.26 _222 _bLAU-I
084			_aCOM000000 _2bisacsh
100	1		_aLau, Lap Chi
245	1	0	_aIterative methods in combinatorial optimization _cLap Chi Lau, R. Ravi, Mohit Singh.
260			_aNew York : _bCambridge University Press, _c©2011.
300			_axi, 242 p. : _bill. ; _c24 cm.
490	1		_aCambridge texts in applied mathematics
504			_aIncludes bibliographical references and index.
520			_a"With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence, and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms"--
520			_a"With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms"--
650		0	_aIterative methods (Mathematics)
650		0	_aCombinatorial optimization.
700	1		_aRavi, R.
700	1		_aSingh, Mohit
830		0	_aCambridge texts in applied mathematics.
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_2ddc _cBK
999			_c10078 _d10078