Cover Image
Read Now

Algorithms and Data Structures 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings

Bibliographic Details
Other Authors: Dehne, Frank (Editor), Sack, Jörg Rüdiger (Editor), Smid, Michiel (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2003, 2003
Edition:1st ed. 2003
Series:Lecture Notes in Computer Science
Subjects:
Artificial Intelligence / Data Processing
Computer Graphics
Programming Techniques
Computer Science / Mathematics
Numerical Analysis
Computer Programming
Discrete Mathematics In Computer Science
Algorithms
Discrete Mathematics
Data Science
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 04119nmm a2200433 u 4500
001 EB000656216
003 EBX01000000000000000509298
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783540450788 
100 1 |a Dehne, Frank  |e [editor] 
245 0 0 |a Algorithms and Data Structures  |h Elektronische Ressource  |b 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings  |c edited by Frank Dehne, Jörg Rüdiger Sack, Michiel Smid 
250 |a 1st ed. 2003 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2003, 2003 
300 |a XII, 522 p  |b online resource 
505 0 |a Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem -- Chips on Wafers -- A Model for Analyzing Black-Box Optimization -- On the Hausdorff Voronoi Diagram of Point Clusters in the Plane -- Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries -- Significant-Presence Range Queries in Categorical Data -- Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms — the Case of k-Internal Spanning Tree -- Parameterized Complexity of Directed Feedback Set Problems in Tournaments -- Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs -- New Directions and New Challenges in Algorithm Design and Complexity, Parameterized 
505 0 |a Multi-party Pseudo-Telepathy -- Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips -- Shape Segmentation and Matching with Flow Discretization -- Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content -- Toward Optimal Motif Enumeration -- Common-Deadline Lazy Bureaucrat Scheduling Problems -- Bandwidth-Constrained Allocation in Grid Computing -- Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection -- Fast Algorithms for a Class of Temporal Range Queries -- Distribution-Sensitive Binomial Queues -- Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees -- Extremal Configurations and Levels in Pseudoline Arrangements -- Fast Relative Approximation of Potential Fields -- The One-Round Voronoi Game Replayed -- Integrated Prefetching and Caching with Read and Write Requests -- Online Seat Reservations via Offline Seating Arrangements --  
505 0 |a Routing and Call Control Algorithms for Ring Networks -- Algorithms and Models for Railway Optimization -- Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles -- Multi-way Space Partitioning Trees -- Cropping-Resilient Segmented Multiple Watermarking -- On Simultaneous Planar Graph Embeddings -- Smoothed Analysis -- Approximation Algorithm for Hotlink Assignments in Web Directories -- Drawing Graphs with Large Vertices and Thick Edges -- Semi-matchings for Bipartite Graphs and Load Balancing -- The Traveling Salesman Problem for Cubic Graphs -- Sorting Circular Permutations by Reversal -- An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data -- Dynamic Text and Static Pattern Matching -- Real Two Dimensional Scaled Matching -- Proximity Structures for Geometric Graphs -- The Zigzag Path of a Pseudo-Triangulation -- Alternating Paths along Orthogonal Segments --  
653 |a Artificial intelligence / Data processing 
653 |a Computer graphics 
653 |a Programming Techniques 
653 |a Computer science / Mathematics 
653 |a Numerical Analysis 
653 |a Computer programming 
653 |a Discrete Mathematics in Computer Science 
653 |a Computer Graphics 
653 |a Algorithms 
653 |a Numerical analysis 
653 |a Discrete mathematics 
653 |a Data Science 
700 1 |a Sack, Jörg Rüdiger  |e [editor] 
700 1 |a Smid, Michiel  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
028 5 0 |a 10.1007/b11837 
856 4 0 |u https://doi.org/10.1007/b11837?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 005.11 

Similar Items