LEADER 04687nam 22007455 450 001 996465379903316 005 20230406012915.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 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithm Theory ? SWAT 2008$b[electronic resource] $e11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings /$fedited by Joachim Gudmundsson 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XIII, 438 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5124 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$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5124 606 $aArtificial intelligence?Data processing 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aComputer networks 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aData Science 606 $aDiscrete Mathematics 606 $aAlgorithms 606 $aComputer Communication Networks 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 615 0$aArtificial intelligence?Data processing. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aComputer networks. 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 14$aData Science. 615 24$aDiscrete Mathematics. 615 24$aAlgorithms. 615 24$aComputer Communication Networks. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a005.73 702 $aGudmundsson$b Joachim$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465379903316 996 $aAlgorithm Theory – SWAT 2008$9774343 997 $aUNISA