000			05443nam a22003855i 4500
001			301572
003			MX-SnUAN
005			20160429155714.0
007			cr nn 008mamaa
008			150903s2010 gw | o |||| 0|eng d
020			_a9783642140310 _99783642140310
024	7		_a10.1007/9783642140310 _2doi
035			_avtls000355308
039		9	_a201509030954 _bVLOAD _c201405060348 _dVLOAD _y201402191040 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA76.9.A43
100	1		_aThai, My T. _eeditor. _9299564
245	1	0	_aComputing and Combinatorics : _b16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings / _cedited by My T. Thai, Sartaj Sahni.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
300			_a553 páginas 103 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		_aLecture Notes in Computer Science, _x0302-9743 ; _v6196
500			_aSpringer eBooks
505	0		_aInvited Talks -- Understanding and Inductive Inference -- Computing with Cells: Membrane Systems -- Complexity and Inapproximability -- Boxicity and Poset Dimension -- On the Hardness against Constant-Depth Linear-Size Circuits -- A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model -- The Curse of Connectivity: t-Total Vertex (Edge) Cover -- Counting Paths in VPA Is Complete for #NC 1 -- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas -- Approximation Algorithms -- Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing -- Clustering with or without the Approximation -- A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks -- Approximate Weighted Farthest Neighbors and Minimum Dilation Stars -- Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs -- Graph Theory and Algorithms -- Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph -- Triangle-Free 2-Matchings Revisited -- The Cover Time of Deterministic Random Walks -- Finding Maximum Edge Bicliques in Convex Bipartite Graphs -- A Note on Vertex Cover in Graphs with Maximum Degree 3 -- Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming -- Factorization of Cartesian Products of Hypergraphs -- Graph Drawing and Coloring -- Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs -- On Three Parameters of Invisibility Graphs -- Imbalance Is Fixed Parameter Tractable -- The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs -- Computational Geometry -- Optimal Binary Space Partitions in the Plane -- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems -- Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux -- Detecting Areas Visited Regularly -- Tile-Packing Tomography Is -hard -- The Rectilinear k-Bends TSP -- Tracking a Generator by Persistence -- Auspicious Tatami Mat Arrangements -- Automata, Logic, Algebra and Number Theory -- Faster Generation of Shorthand Universal Cycles for Permutations -- The Complexity of Word Circuits -- On the Density of Regular and Context-Free Languages -- Extensions of the Minimum Cost Homomorphism Problem -- The Longest Almost-Increasing Subsequence -- Universal Test Sets for Reversible Circuits -- Approximate Counting with a Floating-Point Counter -- Network Optimization and Scheduling Algorithm -- Broadcasting in Heterogeneous Tree Networks -- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks -- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties -- Computational Biology and Bioinformatics -- Discovering Pairwise Compatibility Graphs -- Near Optimal Solutions for Maximum Quasi-bicliques -- Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial -- Constant Time Approximation Scheme for Largest Well Predicted Subset -- On Sorting Permutations by Double-Cut-and-Joins -- A Three-String Approach to the Closest String Problem -- A 2k Kernel for the Cluster Editing Problem -- Data Structure and Sampling Theory -- On the Computation of 3D Visibility Skeletons -- The Violation Heap: A Relaxed Fibonacci-Like Heap -- Threshold Rules for Online Sample Selection -- Heterogeneous Subset Sampling -- Cryptography, Security, Coding and Game Theory -- Identity-Based Authenticated Asymmetric Group Key Agreement Protocol -- Zero-Knowledge Argument for Simultaneous Discrete Logarithms -- Directed Figure Codes: Decidability Frontier.
520			_aThis book constitutes the proceedings of the 16th Annual International Conference on Computing and Combinatorics, held in Nha Trang, Vietnam, in July 2010.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aSahni , Sartaj. _eeditor. _995946
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783642140303
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-14031-0 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c301572 _d301572