LEADER 04007nam 2200577 a 450 001 9910484732303321 005 20200520144314.0 010 $a3-540-69903-1 024 7 $a10.1007/978-3-540-69903-3 035 $a(CKB)1000000000490271 035 $a(SSID)ssj0000355433 035 $a(PQKBManifestationID)11272646 035 $a(PQKBTitleCode)TC0000355433 035 $a(PQKBWorkID)10319705 035 $a(PQKB)10841078 035 $a(DE-He213)978-3-540-69903-3 035 $a(MiAaPQ)EBC3068697 035 $a(PPN)127054782 035 $a(EXLCZ)991000000000490271 100 $a20080528d2008 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithm theory-- SWAT 2008 $e11th Scandinavian workshop on algorithm theory, Gothenburg, Sweden, July 2-4, 2008 : proceedings /$fJoachim Gudmundsson (ed.) 205 $a1st ed. 2008. 210 $aBerlin $cSpringer$d2008 215 $a1 online resource (XIII, 438 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v5124 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-69900-7 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- A Survey of Results for Deletion Channels and Related Synchronization Channels -- Nash Bargaining Via Flexible Budget Markets -- Contributed Papers -- Simplified Planar Coresets for Data Streams -- Uniquely Represented Data Structures for Computational Geometry -- I/O Efficient Dynamic Data Structures for Longest Prefix Queries -- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear -- Vision-Based Pursuit-Evasion in a Grid -- Angle Optimization in Target Tracking -- Improved Bounds for Wireless Localization -- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem -- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint -- The Maximum Energy-Constrained Dynamic Flow Problem -- Bounded Unpopularity Matchings -- Data Structures with Local Update Operations -- On the Redundancy of Succinct Data Structures -- Confluently Persistent Tries for Efficient Version Control -- A Uniform Approach Towards Succinct Representation of Trees -- An Algorithm for L(2,1)-Labeling of Trees -- Batch Coloring Flat Graphs and Thin -- Approximating the Interval Constrained Coloring Problem -- A Path Cover Technique for LCAs in Dags -- Boundary Labeling with Octilinear Leaders -- Distributed Disaster Disclosure -- Reoptimization of Steiner Trees -- On the Locality of Extracting a 2-Manifold in -- On Metric Clustering to Minimize the Sum of Radii -- On Covering Problems of Rado -- Packing Rectangles into 2OPT Bins Using Rotations -- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees -- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs -- On a Special Co-cycle Basis of Graphs -- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs -- Spanners of Additively Weighted Point Sets -- The Kinetic Facility Location Problem -- Computing the Greedy Spanner in Near-Quadratic Time -- Parameterized Computational Complexity of Dodgson and Young Elections -- Online Compression Caching -- On Trade-Offs in External-Memory Diameter-Approximation. 410 0$aLecture notes in computer science ;$v5124. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 517 3 $aSWAT 2008 606 $aAlgorithms$vCongresses 606 $aComputational complexity$vCongresses 615 0$aAlgorithms 615 0$aComputational complexity 676 $a005.73 701 $aGudmundsson$b Joachim$01750518 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484732303321 996 $aAlgorithm theory-- SWAT 2008$94185161 997 $aUNINA