000			02827nam a22003975i 4500
001			288812
003			MX-SnUAN
005			20160429154645.0
007			cr nn 008mamaa
008			150903s2012 xxu| o |||| 0|eng d
020			_a9781461417019 _99781461417019
024	7		_a10.1007/9781461417019 _2doi
035			_avtls000340664
039		9	_a201509030350 _bVLOAD _c201404300418 _dVLOAD _y201402061031 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA402.5-402.6
100	1		_aDu, Ding-Zhu. _eautor _9300903
245	1	0	_aDesign and Analysis of Approximation Algorithms / _cby Ding-Zhu Du, Ker-I Ko, Xiaodong Hu.
264		1	_aNew York, NY : _bSpringer New York, _c2012.
300			_axI, 440 páginas 101 ilustraciones _brecurso en línea.
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aSpringer Optimization and Its Applications, _x1931-6828 ; _v62
500			_aSpringer eBooks
505	0		_aPreface -- 1. Introduction -- 2. Greedy Strategy -- 3. Restriction -- 4. Partition -- 5. Guillotine Cut -- 6. Relaxation -- 7. Linear Programming -- 8. Primal-Dual Scheme and Local Ratio -- 9. Semidefinite Programming -- 10. Inapproximability -- Bibliography -- Index.
520			_aWhen precise algorithmic solutions are difficult to compute, the use of approximation algorithms can help. Design and Analysis of Approximation Algorithms is a textbook for a graduate course in theoretical computer science taught globally in universities. It can also be used as a reference work for researchers in the area of design and analysis algorithms.   There are few texts available for this standard course, and those that do exist mainly follow a problem-oriented format. This text follows a structured, technique-oriented presentation. Approximation algorithms are organized into chapters based on the design techniques for the algorithms, enabling the reader to study algorithms of the same nature with ease, and providing an improved understanding of the design and analysis techniques for approximation algorithms. Instructors benefit from this approach allowing for an easy way to present the ideas and techniques of algorithms with a unified approach.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aKo, Ker-I. _eautor _9318735
700	1		_aHu, Xiaodong. _eautor _9318736
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9781461417002
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-1-4614-1701-9 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c288812 _d288812