LEADER 07525nam 22008175 450 001 9910483710303321 005 20251226202507.0 024 7 $a10.1007/11561071 035 $a(CKB)1000000000213284 035 $a(SSID)ssj0000316169 035 $a(PQKBManifestationID)11229644 035 $a(PQKBTitleCode)TC0000316169 035 $a(PQKBWorkID)10263183 035 $a(PQKB)11549439 035 $a(DE-He213)978-3-540-31951-1 035 $a(MiAaPQ)EBC3067825 035 $a(PPN)123097851 035 $a(EXLCZ)991000000000213284 100 $a20100315d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms ? ESA 2005 $e13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings /$fedited by Gerth S. Brodal, Stefano Leonardi 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XVIII, 901 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3669 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-31951-4 311 08$a3-540-29118-0 320 $aIncludes bibliographical references and index. 327 $aDesigning Reliable Algorithms in Unreliable Memories -- From Balanced Graph Partitioning to Balanced Metric Labeling -- Fearful Symmetries: Quantum Computing, Factoring, and Graph Isomorphism -- Exploring an Unknown Graph Efficiently -- Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio -- Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut -- Relax-and-Cut for Capacitated Network Design -- On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,, -- The Complexity of Games on Highly Regular Graphs -- Computing Equilibrium Prices: Does Theory Meet Practice? -- Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions -- An Algorithm for the SAT Problem for Formulae of Linear Length -- Linear-Time Enumeration of Isolated Cliques -- Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs -- Delineating Boundaries for Imprecise Regions -- Exacus: Efficient and Exact Algorithms for Curves and Surfaces -- Min Sum Clustering with Penalties -- Improved Approximation Algorithms for Metric Max TSP -- Unbalanced Graph Cuts -- Low Degree Connectivity in Ad-Hoc Networks -- 5-Regular Graphs are 3-Colorable with Positive Probability -- Optimal Integer Alphabetic Trees in Linear Time -- Predecessor Queries in Constant Time? -- An Algorithm for Node-Capacitated Ring Routing -- On Degree Constrained Shortest Paths -- A New Template for Solving p-Median Problems for Trees in Sub-quadratic Time -- Roll Cutting in the Curtain Industry -- Space Efficient Algorithms for the Burrows-Wheeler Backtransformation -- Cache-Oblivious Comparison-Based Algorithms on Multisets -- Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation -- Allocating Memory in a Lock-Free Manner -- Generating Realistic Terrains with Higher-Order Delaunay Triangulations -- I/O-Efficient Construction of Constrained Delaunay Triangulations -- Convex Hull and Voronoi Diagram of Additively Weighted Points -- New Tools and Simpler Algorithms for Branchwidth -- Treewidth Lower Bounds with Brambles -- Minimal Interval Completions -- A 2-Approximation Algorithm for Sorting by Prefix Reversals -- Approximating the 2-Interval Pattern Problem -- A Loopless Gray Code for Minimal Signed-Binary Representations -- Efficient Approximation Schemes for Geometric Problems? -- Geometric Clustering to Minimize the Sum of Cluster Sizes -- Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs -- Packet Routing and Information Gathering in Lines, Rings and Trees -- Jitter Regulation for Multiple Streams -- Efficient c-Oriented Range Searching with DOP-Trees -- Matching Point Sets with Respect to the Earth Mover?s Distance -- Small Stretch Spanners on Dynamic Graphs -- An Experimental Study of Algorithms for Fully Dynamic Transitive Closure -- Experimental Study of Geometric t-Spanners -- Highway Hierarchies Hasten Exact Shortest Path Queries -- Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays -- Fairness-Free Periodic Scheduling with Vacations -- Online Bin Packing with Cardinality Constraints -- Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines -- Engineering Planar Separator Algorithms -- Stxxl: Standard Template Library for XXL Data Sets -- Negative Cycle Detection Problem -- An Optimal Algorithm for Querying Priced Information: Monotone Boolean Functions and Game Trees -- Online View Maintenance Under a Response-Time Constraint -- Online Primal-Dual Algorithms for Coveringand Packing Problems -- Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information -- Using Fractional Primal-Dual to Schedule Split Intervals with Demands -- An Approximation Algorithm for the Minimum Latency Set Cover Problem -- Workload-Optimal Histograms on Streams -- Finding Frequent Patterns in a String in Sublinear Time -- Online Occlusion Culling -- Shortest Paths in Matrix Multiplication Time -- Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs -- Greedy Routing in Tree-Decomposed Graphs -- Making Chord Robust to Byzantine Attacks -- Bucket Game with Applications to Set Multicover and Dynamic Page Migration -- Bootstrapping a Hop-Optimal Network in the Weak Sensor Model -- Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs -- A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem -- Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack -- Robust Approximate Zeros -- Optimizing a 2D Function Satisfying Unimodality Properties. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3669 606 $aComputer programming 606 $aAlgorithms 606 $aComputer networks 606 $aArtificial intelligence$xData processing 606 $aNumerical analysis 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aProgramming Techniques 606 $aAlgorithms 606 $aComputer Communication Networks 606 $aData Science 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aComputer networks. 615 0$aArtificial intelligence$xData processing. 615 0$aNumerical analysis. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aComputer Communication Networks. 615 24$aData Science. 615 24$aNumerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 676 $a005.11 701 $aBrodal$b Gerth Stlting$f1969-$01756353 701 $aLeonardi$b S$g(Stefano)$01756354 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483710303321 996 $aAlgorithms-- ESA 2005$94193589 997 $aUNINA