04689nam 22007455 450 991048473230332120230406012915.03-540-69903-110.1007/978-3-540-69903-3(CKB)1000000000490271(SSID)ssj0000355433(PQKBManifestationID)11272646(PQKBTitleCode)TC0000355433(PQKBWorkID)10319705(PQKB)10841078(DE-He213)978-3-540-69903-3(MiAaPQ)EBC3068697(PPN)127054782(EXLCZ)99100000000049027120100301d2008 u| 0engurnn|008mamaatxtccrAlgorithm Theory – SWAT 2008[electronic resource] 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings /edited by Joachim Gudmundsson1st ed. 2008.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2008.1 online resource (XIII, 438 p.) Theoretical Computer Science and General Issues,2512-2029 ;5124Bibliographic Level Mode of Issuance: Monograph3-540-69900-7 Includes bibliographical references and index.Invited 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.Theoretical Computer Science and General Issues,2512-2029 ;5124Artificial intelligence—Data processingDiscrete mathematicsAlgorithmsComputer networksComputer science—MathematicsComputer graphicsData ScienceDiscrete MathematicsAlgorithmsComputer Communication NetworksDiscrete Mathematics in Computer ScienceComputer GraphicsArtificial intelligence—Data processing.Discrete mathematics.Algorithms.Computer networks.Computer science—Mathematics.Computer graphics.Data Science.Discrete Mathematics.Algorithms.Computer Communication Networks.Discrete Mathematics in Computer Science.Computer Graphics.005.73Gudmundsson Joachimedthttp://id.loc.gov/vocabulary/relators/edtBOOK9910484732303321Algorithm Theory – SWAT 2008774343UNINA