000			03185nam a22003975i 4500
001			295309
003			MX-SnUAN
005			20160429155222.0
007			cr nn 008mamaa
008			150903s2006 gw | o |||| 0|eng d
020			_a9783540322139 _99783540322139
024	7		_a10.1007/11671541 _2doi
035			_avtls000348251
039		9	_a201509030744 _bVLOAD _c201404121126 _dVLOAD _c201404090903 _dVLOAD _y201402071023 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA76.9.A43
100	1		_aBampis, Evripidis. _eeditor. _9329624
245	1	0	_aEfficient Approximation and Online Algorithms : _bRecent Progress on Classical Combinatorial Optimization Problems and New Applications / _cedited by Evripidis Bampis, Klaus Jansen, Claire Kenyon.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2006.
300			_avii, 349 páginas Also available online. _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		_aLecture Notes in Computer Science, _x0302-9743 ; _v3484
500			_aSpringer eBooks
505	0		_aContributed Talks -- On Approximation Algorithms for Data Mining Applications -- A Survey of Approximation Results for Local Search Algorithms -- Approximation Algorithms for Path Coloring in Trees -- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow -- Independence and Coloring Problems on Intersection Graphs of Disks -- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications -- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines -- Approximating a Class of Classification Problems -- List Scheduling in Order of ?-Points on a Single Machine -- Approximation Algorithms for the k-Median Problem -- The Lovász-Local-Lemma and Scheduling.
520			_aThis book provides a good opportunity for computer science practitioners and researchers to get in sync with the current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques. This state-of-the-art survey contains 11 carefully selected papers that cover some classical problems of scheduling, of packing, and of graph theory, but also new optimization problems arising in various applications like networks, data mining or classification.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aJansen, Klaus. _eeditor. _9329625
700	1		_aKenyon, Claire. _eeditor. _9329626
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783540322122
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/11671541 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c295309 _d295309