LEADER 04398nam 2200577 a 450 001 9910483626003321 005 20200520144314.0 024 7 $a10.1007/11534273 035 $a(CKB)1000000000213160 035 $a(SSID)ssj0000316181 035 $a(PQKBManifestationID)11285823 035 $a(PQKBTitleCode)TC0000316181 035 $a(PQKBWorkID)10262920 035 $a(PQKB)11248830 035 $a(DE-He213)978-3-540-31711-1 035 $a(MiAaPQ)EBC3068012 035 $a(PPN)123096502 035 $a(EXLCZ)991000000000213160 100 $a20050622d2005 uy 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and data structures $e9th international workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005 : proceedings /$fFrank Dehne, Alejandro Lopez-Ortiz, Jorg-Rudiger Sack (eds.) 205 $a1st ed. 2005. 210 $aBerlin ;$aNew York $cSpringer$d2005 215 $a1 online resource (XIV, 446 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v3608 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-31711-2 311 $a3-540-28101-0 320 $aIncludes bibliographical references and index. 327 $aSession 1 -- Towards a Theory of Algorithms -- Session 2A -- k-Restricted Rotation with an Application to Search Tree Rebalancing -- Heap Building Bounds -- Session 2B -- The Multi-radius Cover Problem -- Parameterized Complexity of Generalized Vertex Cover Problems -- The Complexity of Implicit and Space Efficient Priority Queues -- Analysis of a Class of Tries with Adaptive Multi-digit Branching -- Balanced Aspect Ratio Trees Revisited -- Session 3B -- Improved Combinatorial Group Testing for Real-World Problem Sizes -- Parameterized Counting Algorithms for General Graph Covering Problems -- Approximating the Online Set Multicover Problems via Randomized Winnowing -- Session 4A -- Max-stretch Reduction for Tree Spanners -- Succinct Representation of Triangulations with a Boundary -- Line-Segment Intersection Made In-Place -- Session 4B -- Improved Fixed-Parameter Algorithms for Two Feedback Set Problems -- Communication-Aware Processor Allocation for Supercomputers -- Dynamic Hotlinks -- Session 6A -- The Minimum-Area Spanning Tree Problem -- Hinged Dissection of Polypolyhedra -- Session 6B -- Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms -- Linear Time Algorithms for Generalized Edge Dominating Set Problems -- Session 7A -- On Geometric Dilation and Halving Chords -- Orthogonal Subdivisions with Low Stabbing Numbers -- Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes -- Session 7B -- Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length -- A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs -- The On-line Asymmetric Traveling Salesman Problem -- Session 8A -- All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time -- k-Link Shortest Paths in Weighted Subdivisions -- Power-Saving Scheduling for Weakly Dynamic Voltage Scaling Devices -- Session 8B -- Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems -- On the Vehicle Routing Problem -- Session 9A -- The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case -- Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms -- Derandomization of Dimensionality Reduction and SDP Based Algorithms -- Session 9B -- Subquadratic Algorithms for 3SUM -- Near-Optimal Pricing in Near-Linear Time -- Improved Approximation Bounds for Planar Point Pattern Matching. 410 0$aLecture notes in computer science ;$v3608. 517 3 $aWADS 2005 606 $aData structures (Computer science)$vCongresses 606 $aComputer algorithms$vCongresses 615 0$aData structures (Computer science) 615 0$aComputer algorithms 676 $a005.7/3 701 $aDehne$b F$g(Frank),$f1960-$01759177 701 $aLopez-Ortiz$b Alejandro$01753894 701 $aSack$b J.-R$g(Jorg-Rudiger),$f1954-$01708135 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483626003321 996 $aAlgorithms and data structures$94197544 997 $aUNINA