The Resource Algorithm Theory " SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3 5, 2002 Proceedings
Algorithm Theory " SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3 5, 2002 Proceedings
Resource Information
The item Algorithm Theory " SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3 5, 2002 Proceedings represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Algorithm Theory " SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3 5, 2002 Proceedings represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 Summary
 This book constitutes the refereed proceedings of the 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002, held in Turku, Finland, in July 2002. The 43 revised full papers presented together with two invited contributions were carefully reviewed and selected from 103 submissions. The papers are organized in topical sections on scheduling, computational geometry, graph algorithms, robotics, approximation algorithms, data communication, computational biology, and data storage and manipulation
 Language
 eng
 Extent
 1 online resource.
 Contents

 Invited Speakers
 An Efficient Quasidictionary
 Combining Pattern Discovery and Probabilistic Modeling in Data Mining
 Scheduling
 Time and Space Efficient Multimethod 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 Factor2 Approximation for Labeling Points with Maximum Sliding Labels
 Optimal Algorithm for a Special PointLabeling 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 ClusteringType Approximation Algorithms
 A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid
 Approximation Algorithms for EdgeDilation kCenter Problems
 Forewarned Is ForeArmed: 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 FreezeTag Problem
 Approximation Algorithms
 Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems
 AllNorm 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 Multiconstrained Routing Problem
 Computational Biology
 Computing the Threshold for qGram 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 Fillin with the Modular Decomposition
 Performance Tuning an Algorithm for Compressing Relational Tables
 A Randomized InPlace 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 AVLTrees
 Isbn
 9783540454717
 Label
 Algorithm Theory " SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3 5, 2002 Proceedings
 Title
 Algorithm Theory " SWAT 2002
 Title remainder
 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3 5, 2002 Proceedings
 Subject

 Computational complexity
 Computational complexity
 Computer graphics
 Computer graphics
 Computer science
 Computer science
 Computer software
 Computer software
 Data structures (Computer science)
 Data structures (Computer science)
 Discrete Mathematics in Computer Science
 Algorithm Analysis and Problem Complexity
 Language
 eng
 Summary
 This book constitutes the refereed proceedings of the 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002, held in Turku, Finland, in July 2002. The 43 revised full papers presented together with two invited contributions were carefully reviewed and selected from 103 submissions. The papers are organized in topical sections on scheduling, computational geometry, graph algorithms, robotics, approximation algorithms, data communication, computational biology, and data storage and manipulation
 Cataloging source
 DKDLA
 http://library.link/vocab/creatorDate
 1948
 http://library.link/vocab/creatorName
 Penttonen, Martti
 Dewey number
 005.1
 Index
 no index present
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 Nature of contents

 dictionaries
 standards specifications
 http://library.link/vocab/relatedWorkOrContributorName
 Schmidt, Erik Meineche
 Series statement
 Lecture Notes in Computer Science
 Series volume
 2368,
 http://library.link/vocab/subjectName

 Computer science
 Data structures (Computer science)
 Computer software
 Computational complexity
 Computer graphics
 Algorithm Analysis and Problem Complexity
 Discrete Mathematics in Computer Science
 Computational complexity
 Computer graphics
 Computer science
 Computer software
 Data structures (Computer science)
 Label
 Algorithm Theory " SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3 5, 2002 Proceedings
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Invited Speakers  An Efficient Quasidictionary  Combining Pattern Discovery and Probabilistic Modeling in Data Mining  Scheduling  Time and Space Efficient Multimethod 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 Factor2 Approximation for Labeling Points with Maximum Sliding Labels  Optimal Algorithm for a Special PointLabeling 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 ClusteringType Approximation Algorithms  A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid  Approximation Algorithms for EdgeDilation kCenter Problems  Forewarned Is ForeArmed: 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 FreezeTag Problem  Approximation Algorithms  Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems  AllNorm 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 Multiconstrained Routing Problem  Computational Biology  Computing the Threshold for qGram 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 Fillin with the Modular Decomposition  Performance Tuning an Algorithm for Compressing Relational Tables  A Randomized InPlace 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 AVLTrees
 Control code
 768064010
 Extent
 1 online resource.
 Form of item
 online
 Isbn
 9783540454717
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Specific material designation
 remote
 System control number
 (OCoLC)768064010
 Label
 Algorithm Theory " SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3 5, 2002 Proceedings
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Invited Speakers  An Efficient Quasidictionary  Combining Pattern Discovery and Probabilistic Modeling in Data Mining  Scheduling  Time and Space Efficient Multimethod 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 Factor2 Approximation for Labeling Points with Maximum Sliding Labels  Optimal Algorithm for a Special PointLabeling 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 ClusteringType Approximation Algorithms  A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid  Approximation Algorithms for EdgeDilation kCenter Problems  Forewarned Is ForeArmed: 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 FreezeTag Problem  Approximation Algorithms  Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems  AllNorm 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 Multiconstrained Routing Problem  Computational Biology  Computing the Threshold for qGram 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 Fillin with the Modular Decomposition  Performance Tuning an Algorithm for Compressing Relational Tables  A Randomized InPlace 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 AVLTrees
 Control code
 768064010
 Extent
 1 online resource.
 Form of item
 online
 Isbn
 9783540454717
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Specific material designation
 remote
 System control number
 (OCoLC)768064010
Subject
 Computational complexity
 Computational complexity
 Computer graphics
 Computer graphics
 Computer science
 Computer science
 Computer software
 Computer software
 Data structures (Computer science)
 Data structures (Computer science)
 Discrete Mathematics in Computer Science
 Algorithm Analysis and Problem Complexity
Member of
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/AlgorithmTheorySWAT20028thScandinavian/M2MNe76wvdY/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/AlgorithmTheorySWAT20028thScandinavian/M2MNe76wvdY/">Algorithm Theory " SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3 5, 2002 Proceedings</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Algorithm Theory " SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3 5, 2002 Proceedings
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/AlgorithmTheorySWAT20028thScandinavian/M2MNe76wvdY/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/AlgorithmTheorySWAT20028thScandinavian/M2MNe76wvdY/">Algorithm Theory " SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3 5, 2002 Proceedings</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>