06465nam 22007935 450 99646553110331620200704005335.03-540-45471-310.1007/3-540-45471-3(CKB)1000000000211772(SSID)ssj0000321165(PQKBManifestationID)11283918(PQKBTitleCode)TC0000321165(PQKBWorkID)10262619(PQKB)10684809(DE-He213)978-3-540-45471-7(MiAaPQ)EBC3072543(PPN)155173863(EXLCZ)99100000000021177220121227d2002 u| 0engurnn|008mamaatxtccrAlgorithm Theory - SWAT 2002[electronic resource] 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings /edited by Martti Penttonen, Erik Meineche Schmidt1st ed. 2002.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2002.1 online resource (XIV, 452 p.) Lecture Notes in Computer Science,0302-9743 ;2368Bibliographic Level Mode of Issuance: Monograph3-540-43866-1 Includes bibliographical references at the end of each chapters and index.Invited 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.Lecture Notes in Computer Science,0302-9743 ;2368Computer programmingAlgorithmsData structures (Computer science)Computer science—MathematicsComputer graphicsComputer communication systemsProgramming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Computer Graphicshttps://scigraph.springernature.com/ontologies/product-market-codes/I22013Computer Communication Networkshttps://scigraph.springernature.com/ontologies/product-market-codes/I13022Computer programming.Algorithms.Data structures (Computer science).Computer science—Mathematics.Computer graphics.Computer communication systems.Programming Techniques.Algorithm Analysis and Problem Complexity.Data Structures.Discrete Mathematics in Computer Science.Computer Graphics.Computer Communication Networks.511.8Penttonen Marttiedthttp://id.loc.gov/vocabulary/relators/edtMeineche Schmidt Erikedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK996465531103316Algorithm Theory - SWAT 20022257123UNISA