000 | 02712nam a22003975i 4500 | ||
---|---|---|---|
001 | 304585 | ||
003 | MX-SnUAN | ||
005 | 20160429155910.0 | ||
007 | cr nn 008mamaa | ||
008 | 150903s2011 gw | o |||| 0|eng d | ||
020 |
_a9783642229350 _99783642229350 |
||
024 | 7 |
_a10.1007/9783642229350 _2doi |
|
035 | _avtls000357575 | ||
039 | 9 |
_a201509030559 _bVLOAD _c201405070218 _dVLOAD _y201402191318 _zstaff |
|
040 |
_aMX-SnUAN _bspa _cMX-SnUAN _erda |
||
050 | 4 | _aQA76.9.A43 | |
100 | 1 |
_aGoldberg, Leslie Ann. _eeditor. _9343464 |
|
245 | 1 | 0 |
_aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : _b14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings / _cedited by Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2011. |
|
300 |
_axv, 702 páginas _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 ; _v6845 |
|
500 | _aSpringer eBooks | ||
520 | _aThis book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, USA, in August 2011. The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems. | ||
590 | _aPara consulta fuera de la UANL se requiere clave de acceso remoto. | ||
700 | 1 |
_aJansen, Klaus. _eeditor. _9329625 |
|
700 | 1 |
_aRavi, R. _eeditor. _9343465 |
|
700 | 1 |
_aRolim, José D. P. _eeditor. _9329687 |
|
710 | 2 |
_aSpringerLink (Servicio en línea) _9299170 |
|
776 | 0 | 8 |
_iEdición impresa: _z9783642229343 |
856 | 4 | 0 |
_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-22935-0 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL) |
942 | _c14 | ||
999 |
_c304585 _d304585 |