LEADER 07571nam 22007575 450 001 996465437903316 005 20200704235031.0 010 $a3-540-30140-2 024 7 $a10.1007/b100428 035 $a(CKB)1000000000212547 035 $a(SSID)ssj0000101106 035 $a(PQKBManifestationID)11131456 035 $a(PQKBTitleCode)TC0000101106 035 $a(PQKBWorkID)10037417 035 $a(PQKB)10856040 035 $a(DE-He213)978-3-540-30140-0 035 $a(MiAaPQ)EBC3088983 035 $a(PPN)155180878 035 $a(EXLCZ)991000000000212547 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms -- ESA 2004$b[electronic resource] $e12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings /$fedited by Susanne Albers, Tomasz Radzik 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (XXXVI, 836 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v3221 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-23025-4 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Lectures -- A Survey of FPT Algorithm Design Techniques with an Emphasis on Recent Advances and Connections to Practical Computing -- Algorithmic Aspects of Web Search Engines -- Design and Analysis Track -- Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects -- Swap and Mismatch Edit Distance -- Path Decomposition Under a New Cost Measure with Applications to Optical Network Design -- Optimal External Memory Planar Point Enclosure -- Maximizing Throughput in Multi-queue Switches -- An Improved Algorithm for CIOQ Switches -- Labeling Smart Dust -- Graph Decomposition Lemmas and Their Role in Metric Embedding Methods -- Modeling Locality: A Probabilistic Analysis of LRU and FWF -- An Algorithm for Computing DNA Walks -- Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems -- Direct Routing: Algorithms and Complexity -- Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families -- A Parameterized Algorithm for Upward Planarity Testing -- Fisher Equilibrium Price with a Class of Concave Utility Functions -- Hardness and Approximation Results for Packing Steiner Trees -- Approximation Hardness of Dominating Set Problems -- Improved Online Algorithms for Buffer Management in QoS Switches -- Time Dependent Multi Scheduling of Multicast -- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems -- The Average Case Analysis of Partition Sorts -- A Fast Distributed Algorithm for Approximating the Maximum Matching -- Extreme Points Under Random Noise -- Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings -- On Variable-Sized Multidimensional Packing -- An Inductive Construction for Plane Laman Graphs via Vertex Splitting -- Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems -- On the Evolution of Selfish Routing -- Competitive Online Approximation of the Optimal Search Ratio -- Incremental Algorithms for Facility Location and k-Median -- Dynamic Shannon Coding -- Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries -- Negotiation-Range Mechanisms: Coalition-Resistant Markets -- Approximation Algorithms for Quickest Spanning Tree Problems -- An Approximation Algorithm for Maximum Triangle Packing -- Approximate Parameterized Matching -- Approximation of Rectangle Stabbing and Interval Stabbing Problems -- Fast 3-Coloring Triangle-Free Planar Graphs -- Approximate Unions of Lines and Minkowski Sums -- Radio Network Clustering from Scratch -- Seeking a Vertex of the Planar Matching Polytope in NC -- Equivalence of Search Capability Among Mobile Guards with Various Visibilities -- Load Balancing in Hypercubic Distributed Hash Tables with Heterogeneous Processors -- On the Stability of Multiple Partner Stable Marriages with Ties -- Flows on Few Paths: Algorithms and Lower Bounds -- Maximum Matchings in Planar Graphs via Gaussian Elimination -- Fast Multipoint Evaluation of Bivariate Polynomials -- On Adaptive Integer Sorting -- Tiling a Polygon with Two Kinds of Rectangles -- On Dynamic Shortest Paths Problems -- Uniform Algorithms for Deterministic Construction of Efficient Dictionaries -- Fast Sparse Matrix Multiplication -- Engineering and Applications Track -- An Experimental Study of Random Knapsack Problems -- Contraction and Treewidth Lower Bounds -- Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks -- Comparing Real Algebraic Numbers of Small Degree -- Code Flexibility and Program Efficiency by Genericity: Improving Cgal ?s Arrangements -- Finding Dominators in Practice -- Data Migration on Parallel Disks -- Classroom Examples of Robustness Problems in Geometric Computations -- Stable Minimum Storage Merging by Symmetric Comparisons -- On Rectangular Cartograms -- Multi-word Atomic Read/Write Registers on Multiprocessor Systems -- Beyond Optimal Play in Two-Person-Zerosum Games -- Solving Geometric Covering Problems by Data Reduction -- Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions -- Super Scalar Sample Sort -- Construction of Minimum-Weight Spanners -- A Straight Skeleton Approximating the Medial Axis -- Non-additive Shortest Paths. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v3221 606 $aSoftware engineering 606 $aAlgorithms 606 $aNumerical analysis 606 $aComputer science?Mathematics 606 $aData structures (Computer science) 606 $aComputer communication systems 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 0$aNumerical analysis. 615 0$aComputer science?Mathematics. 615 0$aData structures (Computer science). 615 0$aComputer communication systems. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aNumeric Computing. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Structures. 615 24$aComputer Communication Networks. 676 $a005.1 702 $aAlbers$b Susanne$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRadzik$b Tomasz$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465437903316 996 $aAlgorithms -- ESA 2004$92089156 997 $aUNISA