LEADER 06465nam 22007935 450 001 996465531103316 005 20200704005335.0 010 $a3-540-45471-3 024 7 $a10.1007/3-540-45471-3 035 $a(CKB)1000000000211772 035 $a(SSID)ssj0000321165 035 $a(PQKBManifestationID)11283918 035 $a(PQKBTitleCode)TC0000321165 035 $a(PQKBWorkID)10262619 035 $a(PQKB)10684809 035 $a(DE-He213)978-3-540-45471-7 035 $a(MiAaPQ)EBC3072543 035 $a(PPN)155173863 035 $a(EXLCZ)991000000000211772 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithm Theory - SWAT 2002$b[electronic resource] $e8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings /$fedited by Martti Penttonen, Erik Meineche Schmidt 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XIV, 452 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2368 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-43866-1 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Speakers -- An Efficient Quasidictionary -- Combining Pattern Discovery and Probabilistic Modeling in Data Mining -- Scheduling -- Time and Space Efficient Multi-method Dispatching -- Linear Time Approximation Schemes for Vehicle Scheduling -- Minimizing Makespan for the Lazy Bureaucrat Problem -- A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times -- Computational Geometry -- Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains -- Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D -- Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains -- Exact Algorithms and Approximation Schemes for Base Station Placement Problems -- A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels -- Optimal Algorithm for a Special Point-Labeling Problem -- Random Arc Allocation and Applications -- On Neighbors in Geometric Permutations -- Graph Algorithms -- Powers of Geometric Intersection Graphs and Dispersion Algorithms -- Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case -- Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous -- Approximation Hardness of the Steiner Tree Problem on Graphs -- The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus -- The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms -- A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid -- Approximation Algorithms for Edge-Dilation k-Center Problems -- Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm -- Improved Algorithms for the Random Cluster Graph Model -- ?-List Vertex Coloring in Linear Time -- Robotics -- Robot Localization without Depth Perception -- Online Parallel Heuristics and Robot Searching under the Competitive Framework -- Analysis of Heuristics for the Freeze-Tag Problem -- Approximation Algorithms -- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems -- All-Norm Approximation Algorithms -- Approximability of Dense Instances of Nearest Codeword Problem -- Data Communication -- Call Control with k Rejections -- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem -- Packet Bundling -- Algorithms for the Multi-constrained Routing Problem -- Computational Biology -- Computing the Threshold for q-Gram Filters -- On the Generality of Phylogenies from Incomplete Directed Characters -- Data Storage and Manipulation -- Sorting with a Forklift -- Tree Decompositions with Small Cost -- Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition -- Performance Tuning an Algorithm for Compressing Relational Tables -- A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset -- Paging on a RAM with Limited Resources -- An Optimal Algorithm for Finding NCA on Pure Pointer Machines -- Amortized Complexity of Bulk Updates in AVL-Trees. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2368 606 $aComputer programming 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aComputer communication systems 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 0$aComputer communication systems. 615 14$aProgramming Techniques. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aData Structures. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 615 24$aComputer Communication Networks. 676 $a511.8 702 $aPenttonen$b Martti$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMeineche Schmidt$b Erik$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465531103316 996 $aAlgorithm Theory - SWAT 2002$92257123 997 $aUNISA