1 option
Algorithm Theory - SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings / edited by Martti Penttonen, Erik Meineche Schmidt.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2368.
- Lecture Notes in Computer Science, 0302-9743 ; 2368
- Language:
- English
- Subjects (All):
- Computer programming.
- Algorithms.
- Data structures (Computer science).
- Computer science--Mathematics.
- Computer science.
- Computer graphics.
- Computer networks.
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Discrete Mathematics in Computer Science.
- Computer Graphics.
- Computer Communication Networks.
- Local Subjects:
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Discrete Mathematics in Computer Science.
- Computer Graphics.
- Computer Communication Networks.
- Physical Description:
- 1 online resource (XIV, 452 pages).
- Edition:
- First edition 2002.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-45471-7
- 9783540454717
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.