Algorithms and Data Structures

6th International Workshop, WADS'99 Vancouver, Canada, August 11-14, 1999 Proceedings

Häftad, Engelska, 1999

Av Frank Dehne, Arvind Gupta, Jörg-Rüdiger Sack, Roberto Tamassia

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the 6th International Workshop on Algorithms and Data Structures, WADS'99, held in Vancouver, Canada, in August 1999.The 32 revised papers presented were carefully reviewed and selected from a total of 71 submissions. Among the topics covered are data structures and algorithmic aspects in a variety of areas such as graph theory, networking, load balancing, optimization, approximation, sorting and searching, pattern matching, information retrieval, computational mathematics, etc.

Produktinformation

Utgivningsdatum1999-07-21
Mått155 x 235 x 21 mm
Vikt587 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor378
Upplaga1999
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540662792

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Databaser inom Data och it

Optimization over k-set Polytopes and Efficient k-set Enumeration.- Line Simplification with Restricted Orientations.- The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout.- Resizable Arrays in Optimal Time and Space.- Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions.- Design and Analysis of Algorithms for Shared-Memory Multiprocessors.- On the Complexity of Orthogonal Compaction.- Optimizing Constrained Offset and Scaled Polygonal Annuli.- The Accomodating Function — A Generalization of the Competitive Ratio.- Performance Guarantees for the TSP with a Parameterized Triangle Inequality.- Robot Map Verification of a Graph World.- Searching Rectilinear Streets Completely.- General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time.- The Lazy Bureaucrat Scheduling Problem.- Generating 3D Virtual Populations from Pictures of a Few Individuals.- Testing the Quality of Manufactured Balls.- On an Optimal Split Tree Problem.- Representing Trees of Higher Degree.- Indexing and Dictionary Matching with One Error (Extended Abstract).- New Results on Fault Tolerant Geometric Spanners.- Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences.- Go-With-The-Winners Heuristic.- 2-Point Site Voronoi Diagrams.- A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane.- Position-Independent Street Searching.- Approximation Algorithms for 3-D Common Substructure Identification in Drug and Protein Molecules.- A Tight Bound for ?-Skeleton of Minimum Weight Triangulations.- Rectilinear Static and Dynamic Discrete 2-center Problems.- Gene Trees and Species Trees: The Gene-Duplication Problem is Fixed-Parameter Tractable.- Efficient Web Searching UsingTemporal Factors.- Elastic Labels Around the Perimeter of a Map.- Optimal Facility Location under Various Distance Functions.- Thresholds for Sports Elimination Numbers: Algorithms and Complexity.- Dynamic Representations of Sparse Graphs.- Online Data Structures in External Memory.