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

Cover
Springer Science & Business Media, 16.07.2003 - 522 Seiten
The papers in this volume were presented at the 8th Workshop on Algorithms and Data Structures (WADS 2003). The workshop took place July 30–August 1, 2003, at Carleton University in Ottawa, Canada. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the tradition of SWAT and WADS starting with SWAT’88 and WADS’89. In response to the call for papers, 126 papers were submitted. From these submissions, the program committee selected 40 papers for presentation at the workshop. In addition, invited lectures were given by the following distinguished researchers: Gilles Brassard, Dorothea Wagner, Daniel Spielman, and Michael Fellows. Atthisyear’sworkshop,WingT.Yan(NelliganO’BrienPayneLLP,Ottawa) gave a special presentation on “Protecting Your Intellectual Property.” On July 29, Hans-Georg Zimmermann (Siemens AG, Munc ̈ hen) gave a seminar on “N- ral Networks in System Identi?cation and Forecasting: Principles, Techniques, and Applications,” and on August 2 there was a workshop on “Fixed Parameter Tractability” organized by Frank Dehne, Michael Fellows, Mike Langston, and Fran Rosamond. On behalf of the program committee, we would like to express our apprec- tion to the invited speakers and to all authors who submitted papers.
 

Inhalt

Multiparty PseudoTelepathy
1
Shape Segmentation and Matching with Flow Discretization
25
Toward Optimal Motif Enumeration
47
BandwidthConstrained Allocation in Grid Computing
67
Fast Algorithms for a Class of Temporal Range Queries
91
Optimal WorstCase Operations for Implicit CacheOblivious
114
Extremal Configurations and Levels in Pseudoline
127
Fast Relative Approximation of Potential Fields
140
Semimatchings for Bipartite Graphs and Load Balancing
294
The Traveling Salesman Problem for Cubic Graphs
307
An Improved Bound on Boolean Matrix Multiplication for Highly
329
Dynamic Text and Static Pattern Matching
340
Real Two Dimensional Scaled Matching
353
The Zigzag Path of a PseudoTriangulation
377
Improved Approximation Algorithms for the Quality of Service
401
A Model for Analyzing BlackBox Optimization
424

The OneRound Voronoi Game Replayed
150
Online Seat Reservations via Offline Seating Arrangements
174
Algorithms and Models for Railway Optimization
198
Multiway Space Partitioning Trees
219
On Simultaneous Planar Graph Embeddings
243
Smoothed Analysis Motivation and Discrete Models
256
Approximation Algorithm for Hotlink Assignments in Web Directories
271
On the Hausdorff Voronoi Diagram of Point Clusters in the Plane
439
SignificantPresence Range Queries in Categorical Data
462
Parameterized Complexity of Directed Feedback Set Problems
484
New Directions and New Challenges in Algorithm Design
505
Author Index
521
Urheberrecht

Andere Ausgaben - Alle anzeigen

Häufige Begriffe und Wortgruppen

Bibliografische Informationen