000			05883nam a22004095i 4500
001			297057
003			MX-SnUAN
005			20160429155400.0
007			cr nn 008mamaa
008			150903s2007 gw | o |||| 0|eng d
020			_a9783540742081 _99783540742081
024	7		_a10.1007/9783540742081 _2doi
035			_avtls000350778
039		9	_a201509030430 _bVLOAD _c201405060240 _dVLOAD _y201402171105 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA76.9.A43
100	1		_aCharikar, Moses. _eeditor. _9332538
245	1	0	_aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : _b10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007. Proceedings / _cedited by Moses Charikar, Klaus Jansen, Omer Reingold, José D. P. Rolim.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007.
300			_axii, 626 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 ; _v4627
500			_aSpringer eBooks
505	0		_aContributed Talks of APPROX -- Approximation Algorithms and Hardness for Domination with Propagation -- A Knapsack Secretary Problem with Applications -- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem -- Improved Approximation Algorithms for the Spanning Star Forest Problem -- Packing and Covering ?-Hyperbolic Spaces by Balls -- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems -- Two Randomized Mechanisms for Combinatorial Auctions -- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs -- Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows -- Stochastic Steiner Tree with Non-uniform Inflation -- On the Approximation Resistance of a Random Predicate -- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ?1 Embeddability of Negative Type Metrics -- Optimal Resource Augmentations for Online Knapsack -- Soft Edge Coloring -- Approximation Algorithms for the Max-Min Allocation Problem -- Hardness of Embedding Metric Spaces of Equal Size -- Coarse Differentiation and Multi-flows in Planar Graphs -- Maximum Gradient Embeddings and Monotone Clustering -- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems -- Encouraging Cooperation in Sharing Supermodular Costs -- Almost Exact Matchings -- Contributed Talks of RANDOM -- On Approximating the Average Distance Between Points -- On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR -- A Sequential Algorithm for Generating Random Graphs -- Local Limit Theorems for the Giant Component of Random Hypergraphs -- Derandomization of Euclidean Random Walks -- High Entropy Random Selection Protocols -- Testing st-Connectivity -- Properly 2-Colouring Linear Hypergraphs -- Random Subsets of the Interval and P2P Protocols -- The Cover Time of Random Digraphs -- Eigenvectors of Random Graphs: Nodal Domains -- Lower Bounds for Swapping Arthur and Merlin -- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects -- On Estimating Frequency Moments of Data Streams -- Distribution-Free Testing Lower Bounds for Basic Boolean Functions -- On the Randomness Complexity of Property Testing -- On the Benefits of Adaptivity in Property Testing of Dense Graphs -- Slow Mixing of Markov Chains Using Fault Lines and Fat Contours -- Better Binary List-Decodable Codes Via Multilevel Concatenation -- Worst-Case to Average-Case Reductions Revisited -- On Finding Frequent Elements in a Data Stream -- Implementing Huge Sparse Random Graphs -- Sublinear Algorithms for Approximating String Compressibility.
520			_aThis book constitutes the joint refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 and the 11th International Workshop on Randomization and Computation, RANDOM 2007, held in Princeton, NJ, USA, in August 2007. The 44 revised full papers presented were carefully reviewed and selected from 99 submissions. Topics of interest covered by the papers are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, mathematical programming methods, coloring and partitioning, cuts and connectivity, geometric problems, game theory and applications, network design and routing, packing and covering, scheduling, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of approximation and randomness.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aJansen, Klaus. _eeditor. _9329625
700	1		_aReingold, Omer. _eeditor. _9332539
700	1		_aRolim, José D. P. _eeditor. _9329687
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783540742074
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-540-74208-1 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c297057 _d297057