Algorithms and Data Structures

1. Front Matter

   PDF

2. Session 1

   1. Finding Small Holes

      • Jeff Erickson

      Pages 1-1

3. Session 2A

   1. Approximate Range Searching: The Absolute Model

      • Guilherme D. da Fonseca

      Pages 2-14

   2. Orthogonal Range Searching in Linear and Almost-Linear Space

      • Yakov Nekrich

      Pages 15-26

   3. Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere

      • Kengo Terasawa, Yuzuru Tanaka

      Pages 27-38

4. Session 2B

   1. A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity

      • Prabhakar Gubbala, Balaji Raghavachari

      Pages 39-51

   2. Approximating the Maximum Sharing Problem

      • Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo S. Hu, Jian Li, Michael T. Niemier et al.

      Pages 52-63

   3. The Stackelberg Minimum Spanning Tree Game

      • Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman et al.

      Pages 64-76

5. Session 3A

   1. Edges and Switches, Tunnels and Bridges

      • David Eppstein, Marc van Kreveld, Elena Mumford, Bettina Speckmann

      Pages 77-88

   2. How to Draw a Clustered Tree

      • Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati

      Pages 89-101

   3. Drawing Colored Graphs on Colored Points

      • Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta

      Pages 102-113

6. Session 3B

   1. Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric

      • Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu

      Pages 114-126

   2. Priority Queues Resilient to Memory Faults

      • Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave

      Pages 127-138

   3. Simple and Space-Efficient Minimal Perfect Hash Functions

      • Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani

      Pages 139-150

7. Session 4A

   1. A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane

      • Matthias Müller-Hannemann, Siamak Tazari

      Pages 151-162

   2. A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems

      • Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanjay E. Sarma

      Pages 163-174

   3. Optimization for First Order Delaunay Triangulations

      • Marc van Kreveld, Maarten Löffler, Rodrigo I. Silveira

      Pages 175-187

8. Session 4B

   1. Constant Factor Approximations for the Hotlink Assignment Problem

      • Tobias Jacobs

      Pages 188-200

   2. Approximation Algorithms for the Sex-Equal Stable Marriage Problem

      • Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa

      Pages 201-213

   3. A Stab at Approximating Minimum Subadditive Join

      • Staal A. Vinterbo

      Pages 214-225

The papers in this volume were presented at the 10th Workshop on Algorithms and Data Structures (WADS 2005). The workshop took place August 15 - 17, 2007, at Dalhousie University, Halifax, Canada. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the t- dition of SWAT and WADS starting with SWAT 1988 and WADS 1989. From 142 submissions, the Program Committee selected 54 papers for presentation at the workshop. In addition, invited lectures were given by the following dist- guished researchers: Je? Erickson (University of Illinois at Urbana-Champaign) and Mike Langston (University of Tennessee). On behalf of the Program Committee, we would like to express our sincere appreciation to the many persons whose e?ort contributed to making WADS 2007 a success. These include the invited speakers, members of the Steering and ProgramCommittees, the authorswho submitted papers, andthe manyreferees who assisted the Program Committee. We are indebted to Gerardo Reynaga for installing and modifying the submission software, maintaining the submission server and interacting with authors as well as for helping with the preparation of the program.

• algorithm
• algorithms
• computational geometry
• data structure
• data structures
• database
• distributed computing
• algorithm analysis and problem complexity

Policies and ethics