000 06612nam a22006375i 4500
001 978-3-540-30140-0
003 DE-He213
005 20240423132509.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 _a9783540301400
_9978-3-540-30140-0
024 7 _a10.1007/b100428
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aAlgorithms -- ESA 2004
_h[electronic resource] :
_b12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings /
_cedited by Susanne Albers, Tomasz Radzik.
250 _a1st ed. 2004.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2004.
300 _aXXXVI, 836 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v3221
505 0 _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 ’sArrangements -- 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.
650 0 _aSoftware engineering.
650 0 _aAlgorithms.
650 0 _aNumerical analysis.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer networks .
650 1 4 _aSoftware Engineering.
650 2 4 _aAlgorithms.
650 2 4 _aNumerical Analysis.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aData Science.
650 2 4 _aComputer Communication Networks.
700 1 _aAlbers, Susanne.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRadzik, Tomasz.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540230250
776 0 8 _iPrinted edition:
_z9783662206737
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v3221
856 4 0 _uhttps://doi.org/10.1007/b100428
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188392
_d188392