Amazon cover image
Image from Amazon.com

Algorithms and data structures : 6th International Workshop, WADS'99, Vancouver, Canada, August 11-14, 1999 : proceedings / Frank Dehne [and others] (eds.).

By: WADS'99 (1999 : Vancouver, Canada)Contributor(s): Dehne, F. (Frank), 1960-Material type: TextTextSeries: Serienbezeichnung | Lecture notes in computer science ; 1663.Publication details: Berlin ; New York : Springer, 1999. Description: 1 online resource (ix, 368 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540484479; 3540484477Subject(s): Data structures (Computer science) -- Congresses | Computer algorithms -- Congresses | Structures de données (Informatique) -- Congrès | Algorithmes -- Congrès | Computer algorithms | Data structures (Computer science) | Algorithmische Geometrie | Algorithmus | Datenstruktur | Kongress | Algoritmen | Datastructuren | Algoritmos e estruturas de dados | Structures de donnees (informatique) -- Congres | Algorithmes -- CongresGenre/Form: Electronic book. | Electronic books. | Conference papers and proceedings. | Congressen (vorm) | Vancouver (British Columbia, 1999) Additional physical formats: Print version:WADS'99 (1999 : Vancouver, Canada): Algorithms and data structures : 6th International Workshop, WADS'99, Vancouver, Canada, August 11-14, 1999 : proceedingsDDC classification: 005.1 LOC classification: QA76.9.D35 | W333 1999Other classification: 54.10 | SS 4800 | DAT 530f Online resources: Click here to access online
Contents:
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 Using Temporal 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.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

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.

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 Using Temporal 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.

Powered by Koha