000			06520nam a22003975i 4500
001			298190
003			MX-SnUAN
005			20230116100649.0
007			cr nn 008mamaa
008			150903s2007 gw | o |||| 0|eng d
020			_a9783540755203 _99783540755203
024	7		_a10.1007/9783540755203 _2doi
035			_avtls000351102
039		9	_a201509030503 _bVLOAD _c201405060245 _dVLOAD _y201402171113 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA76.9.A43
100	1		_aArge, Lars. _eeditor. _9330152
245	1	0	_aAlgorithms – ESA 2007 : _b15th Annual European Symposium, Eilat, Israel, October 8-10, 2007. Proceedings / _cedited by Lars Arge, Michael Hoffmann, Emo Welzl.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007.
300			_axv, 769 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 ; _v4698
500			_aSpringer eBooks
505	0		_aInvited Lectures -- Nash Equilibria: Where We Stand -- Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation -- Arrangements in Geometry: Recent Advances and Challenges -- Contributed Papers: Design and Analysis Track -- Nash Equilibria in Voronoi Games on Graphs -- Evolutionary Equilibrium in Bayesian Routing Games: Specialization and Niche Formation -- Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks -- Finding Frequent Elements in Non-bursty Streams -- Tradeoffs and Average-Case Equilibria in Selfish Routing -- On the Variance of Subset Sum Estimation -- On Minimum Power Connectivity Problems -- On the Cost of Interchange Rearrangement in Strings -- Finding Mobile Data: Efficiency vs. Location Inaccuracy -- A Faster Query Algorithm for the Text Fingerprinting Problem -- Polynomial Time Algorithms for Minimum Energy Scheduling -- k-Mismatch with Don’t Cares -- Finding Branch-Decompositions and Rank-Decompositions -- Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover -- Linear-Time Ranking of Permutations -- Radix Sorting with No Extra Space -- Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation -- Order Statistics in the Farey Sequences in Sublinear Time -- New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks -- Dial a Ride from k-Forest -- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue -- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication -- Optimal Algorithms for k-Search with Application in Option Pricing -- Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra -- Stackelberg Strategies for Atomic Congestion Games -- Good Quality Virtual Realization of Unit Ball Graphs -- Algorithms for Playing Games with Limited Randomness -- Approximation of Partial Capacitated Vertex Cover -- Optimal Resilient Dynamic Dictionaries -- Determining the Smallest k Such That G Is k-Outerplanar -- On the Size of Succinct Indices -- Compact Oracles for Approximate Distances Around Obstacles in the Plane -- Convex Combinations of Single Source Unsplittable Flows -- Farthest-Polygon Voronoi Diagrams -- Equitable Revisited -- Online Scheduling of Equal-Length Jobs on Parallel Machines -- k-Anonymization with Minimal Loss of Information -- A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs -- Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling -- Bundle Pricing with Comparable Items -- Approximating Interval Scheduling Problems with Bounded Profits -- Pricing Tree Access Networks with Connected Backbones -- Distance Coloring -- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching -- To Fill or Not to Fill: The Gas Station Problem -- Online Bandwidth Allocation -- Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems -- On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems -- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs -- Dynamic Plane Transitive Closure -- Contributed Papers: Engineering and Applications Track -- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments -- Estimating Clustering Indexes in Data Streams -- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics -- Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step -- Fast and Compact Oracles for Approximate Distances in Planar Graphs -- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces -- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks -- Algorithms to Separate -Chvátal-Gomory Cuts -- Fast Lowest Common Ancestor Computations in Dags -- A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem -- Solutions to Real-World Instances of PSPACE-Complete Stacking -- Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough -- An Experimental Study of New and Known Online Packet Buffering Algorithms.
520			_aThis book constitutes the refereed proceedings of the 15th Annual European Symposium on Algorithms, ESA 2007, held in Eilat, Israel, in October 2007 in the context of the combined conference ALGO 2007. The 63 revised full papers presented together with abstracts of 3 invited lectures were carefully reviewed and selected: 50 papers out of 165 submissions for the design and analysis track and 13 out of 44 submissions in the engineering and applications track. The papers address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aWelzl, Emo. _eeditor. _9334406
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783540755197
700	1		_9448426 _aHoffmann, Michael _eeditor.
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-540-75520-3 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c298190 _d298190