000			02714nam a22003495i 4500
001			316582
003			MX-SnUAN
005			20160429160945.0
007			cr nn 008mamaa
008			160108s2014 gw | s |||| 0|eng d
020			_a9783319084046 _9978-3-319-08404-6
035			_avtls000417748
039		9	_y201601081145 _zstaff
050		4	_aQA76.9.A43
245	1	0	_aAlgorithm theory – swat 2014 : _b14th scandinavian symposium and workshops, copenhagen, denmark, july 2-4, 2014. Proceedings / _cedited by R. Ravi, Inge Li Gørtz.
264		1	_aCham : _bSpringer International Publishing : _bSpringer, _c2014.
300			_axx, 394 páginas : _b39 ilustraciones
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 ; _v8503
500			_aSpringer eBooks
505	0		_aOnline Makespan Minimization with Parallel Schedules -- Expected Linear Time Sorting for Word Size ?(log2 n log log n) -- Amortized Analysis of Smooth Quadtrees in All Dimensions -- New Approximability Results for the Robust k-Median Problem -- Approximating the Revenue Maximization Problem with Sharp Demands -- Reconfiguring Independent Sets in Claw-Free Graphs -- Competitive Online Routing on Delaunay Triangulations -- Optimal Planar Orthogonal Skyline Counting Queries -- B-slack Trees: Space Efficient B-Trees -- Approximately Minwise Independence with Twisted Tabulation -- Colorful Bin Packing -- Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques -- Win-Win Kernelization for Degree Sequence Completion Problems -- On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem -- Covering Problems in Edge- and Node-Weighted Graphs -- Colored Range Searching in Linear Space -- Fast Dynamic Graph Algorithms for Parameterized Problems -- Extending Partial Representations of Proper and Unit Interval Graphs -- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams -- Approximate Counting of Matchings in (3,3)-Hypergraphs.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aRavi, R, _eeditor. _9343465
700	1		_aGørtz, Inge Li, _eeditor. _9359806
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783319084039
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-319-08404-6 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c316582 _d316582