Algorithms and data structures : 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007 : proceedings
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- di...
Saved in:
| Main Authors | , , , |
|---|---|
| Format | eBook Book |
| Language | English |
| Published |
Berlin
Springer
2007
Springer Berlin / Heidelberg |
| Edition | 1 |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 9783540739487 3540739483 |
Cover
Table of Contents:
- The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces -- On the Robustness of Graham's Algorithm for Online Scheduling -- Improved Results for a Memory Allocation Problem -- Computational and Structural Advantages of Circular Boundary Representation -- Alpha-Beta Witness Complexes -- Cauchy's Theorem and Edge Lengths of Convex Polyhedra -- Fixed-Parameter Tractability for Non- Crossing Spanning Trees -- Improved Algorithms for the Feedback Vertex Set Problems -- Kernelization Algorithms for d-Hitting Set Problems -- Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points -- Maximizing Maximal Angles for Plane Straight-Line Graphs -- Cuttings for Disks and Axis-Aligned Rectangles -- Kernelization and Complexity Results for Connectivity Augmentation Problems -- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem -- Branch and Recharge: Exact Algorithms for Generalized Domination -- On Computing the Centroid of the Vertices of an Arrangement and Related Problems -- Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p -- Faster Approximation of Distances in Graphs -- Approximate Shortest Paths Guided by a Small Index -- Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model -- Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field -- 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality -- On Euclidean Vehicle Routing with Allocation -- Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets -- Range Non-overlapping Indexing and Successive List Indexing -- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters -- Dynamic TCP Acknowledgment with Sliding Window -- Author Index
- Intro -- Preface -- WADS Organization -- Table of Contents -- Finding Small Holes -- Approximate Range Searching: The Absolute Model -- Orthogonal Range Searching in Linear and Almost-Linear Space -- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere -- A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity -- Approximating the Maximum Sharing Problem -- The Stackelberg Minimum Spanning Tree Game -- Edges and Switches, Tunnels and Bridges -- How to Draw a Clustered Tree -- Drawing Colored Graphs on Colored Points -- Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric -- Priority Queues Resilient to Memory Faults -- Simple and Space-Efficient Minimal Perfect Hash Functions -- A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane -- A Pseudopolynomial Time O(log n)-Approximation Algorithm for Art Gallery Problems -- Optimization for First Order Delaunay Triangulations -- Constant Factor Approximations for the Hotlink Assignment Problem -- Approximation Algorithms for the Sex-Equal Stable Marriage Problem -- A Stab at Approximating Minimum Subadditive Join -- Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets -- Flooding Countries and Destroying Dams -- I/O-Efficient Flow Modeling on Fat Terrains -- Computing the Visibility Map of Fat Objects -- Independent Sets in Bounded-Degree Hypergraphs -- Steiner Tree in Planar Graphs: An O(n log n) Approximation Scheme with Singly-Exponential Dependence on Epsilon -- Computing a Minimum-Depth Planar Graph Embedding in O(n4) Time -- On a Family of Strong Geometric Spanners That Admit Local Routing Strategies -- Spanners for Geometric Intersection Graphs -- On Generalized Diamond Spanners
- Conclusions
- Edges and Switches, Tunnels and Bridges -- Introduction -- Minimizing Switches -- Minimizing Tunnels -- Stacking Model -- Weaving Model -- Conclusions and Open Problems -- References -- How to Draw a Clustered Tree -- Introduction and Overview -- Preliminaries -- R-Drawings of C-Connected C-Trees -- R-Drawings and C-Drawings of Non-C-Connected C-Trees -- NC-Drawings of C-Trees -- References -- Drawing Colored Graphs on Colored Points -- Introduction and Overview -- Preliminaries -- Lower Bound on the Curve Complexity -- Upper Bound on the Curve Complexity -- References -- Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric -- Introduction -- Discrepancy-Sensitive Dynamic Fractional Cascading -- Dynamic Dominated Maxima -- Dynamic Nearest Neighbors in Minkowski Metrics -- Experimental Results -- References -- Priority Queues Resilient to Memory Faults -- Introduction -- Preliminaries -- Fault Tolerant Priority Queue -- Structure -- Push and Pull Primitives -- Insert and Deletemin -- Analysis -- Correctness -- Complexity -- Lower Bound -- References -- Simple and Space-Efficient Minimal Perfect Hash Functions -- Introduction -- Related Work -- Theoretical Results -- Practical Results -- Heuristics -- A Family of Minimal Perfect Hashing Methods -- Mapping Step -- Assigning Step -- Ranking Step -- The 2-Uniform Hypergraph Instance -- Improving the Space -- The 3-Uniform Hypergraph Instance -- Improving the Space -- The Full Randomness Assumption -- Experimental Results -- Conclusions -- References -- A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane -- Introduction -- Related Work -- On Spanners and Banyans -- Our Contribution and Outline -- The Algorithm -- Correctness -- Key Differences -- First Proof -- Uniform Orientation Metrics
- Adapting the Proofs -- Planar Spanners -- References -- A Pseudopolynomial Time O(\log{n})-Approximation Algorithm for ArtGallery Problems -- Introduction -- Basic Terminology -- Initial Triangulation Using Visibility Cell Decomposition -- Further Subdivision of the Initial Triangulation -- Vertex-Visibility Property and Vertex-Pair-Visibility Property -- Further Subdivision -- Set Cover Formulation and Approximate Solution -- Analysis of the Algorithm -- Bound on the Approximation Ratio of Our Algorithm -- Analysis of the Running Time of the Algorithm -- Art Gallery with Holes -- Conclusions -- References -- Optimization for First Order Delaunay Triangulations -- Introduction -- Exact Algorithms -- Measures on Edge-Adjacent Triangles -- Measures on Vertex-Adjacent Triangles -- NP-Hardness Results -- Mixed Vertices -- Maximum Vertex Degree and Convex Edges -- Approximation Algorithms -- Maximizing the Number of Convex Edges -- Maximizing the Number of Non-mixed Vertices -- Maximizing the Number of Convex Edges, k-th Order -- Discussion -- References -- Constant Factor Approximations for the Hotlink Assignment Problem -- Introduction -- Further Notation and Basic Operations -- The Natural Greedy Strategy -- An Approximation Scheme for the Gain -- A 2-Approximation in Terms of the Path Length -- Generalization to Multiple Hotlink Assignment -- Final Remarks -- References -- Approximation Algorithms for the Sex-Equal Stable Marriage Problem -- Introduction -- Rotation Poset -- The Sex-Equal Stable Marriage Problem -- The Minimum Egalitarian Sex-Equal Stable Marriage Problem -- NP-Hardness of MinESE -- Approximation Algorithms for MinESE -- Concluding Remarks -- References -- A Stab at Approximating Minimum Subadditive Join -- Introduction -- A Polynomial Time Approximation Algorithm -- Minimum Coverage -- Hardness
- Approximation of Minimum Loss k-Ambiguity -- Discussion -- References -- Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets -- Flooding Countries and Destroying Dams -- Introduction -- Removing Local Minima by Lifting -- Removing Local Minima by Lowering -- Removing All Local Minima -- Approximation Algorithm -- Other Measures -- Conclusions and Future Work -- References -- I/O-Efficient Flow Modeling on Fat Terrains -- Introduction -- Preliminaries -- Modeling Flow with a Descent Graph -- Computing the Rivers and the Watershed Area Map -- A Data Structure for Flow Path and Watershed Queries -- References -- Computing the Visibility Map of Fat Objects -- Introduction -- Preliminaries -- The Algorithm -- The Data Structure -- Tracing an Arc -- Details of the Algorithm -- References -- Independent Sets in Bounded-Degree Hypergraphs -- Introduction -- Definitions -- Shrinkage Reduction -- Local Search -- Partitioning -- Greedy -- The GreedyMAX Algorithm -- The GreedyMIN Algorithm -- References -- Steiner Tree in Planar Graphs: An O(\log{n}) Approximation Scheme with Singly-Exponential Dependence on Epsilon -- Introduction -- Notation -- Algorithm -- Mortar Graph -- Bricks -- Portals -- Portal-Connected Graph and the Operation {{\cal B}^+} -- Parcels -- New Terminals -- Optimal Solution Within the Parcels -- Proof of the Structure Theorem (Theorem 3) -- Structural Property of Bricks -- Completion of the Proof of Theorem 3 -- References -- Computing a Minimum-Depth Planar Graph Embedding in O(n^4) Time -- Introduction -- Background -- The Combinatorial Structure of Planar Embeddings and Their Depths -- Computing a Minimum-Depth Embedding of a Biconnected Planar Graph -- Labeling an SPQR-Tree with Minimum-Depth Embedding Descriptors -- Computing the Minimum Depth and the Minimum-Depth Embedding
- Intro -- Title Page -- Preface -- Organization -- Table of Contents -- Finding Small Holes -- Approximate Range Searching: The Absolute Model -- Introduction -- Preliminaries -- Halfspace Range Searching -- Approximate Semigroup Version -- Approximate Idempotent Version -- Exact Idempotent Version -- Halfbox Quadtree -- Approximate Spherical Range Searching -- Approximate Simplex Range Searching -- Other Results -- References -- Orthogonal Range Searching in Linear and Almost-Linear Space -- Introduction -- Range Reporting on the Narrow Grid -- Range Counting Queries on the Narrow Grid -- Two-Dimensional Range Searching -- Two-Dimensional Semi-group Range Counting -- References -- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere -- Introduction -- Locality Sensitive Hashing (LSH) -- Spherical LSH (SLSH) -- Problem Description -- Locality Sensitive Hash Functions Using a Regular Polytope -- The Algorithm -- Performance Evaluation -- Discussion -- Conclusion -- References -- A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity -- Introduction -- Definitions -- Locally Connected Cycles and a New Lower Bound -- Examples -- Overview of the Algorithm -- Virtual Edges -- Algorithm 3EdgeConnect(G) -- Selecting a Target Component -- 2-Connecting a Cycle -- 2-Connecting a Path -- Summary -- References -- Approximating the Maximum Sharing Problem -- Introduction -- Approximating MS: A Special Case -- The Color Path-Cycle Packing Problem (CPCP) -- Solving CPCP -- A 1.5-Approximation for CPP and MS -- A More Practical 1.5-Approximation Algorithm -- Approximating MS: The General Case -- References -- The Stackelberg Minimum Spanning Tree Game -- Introduction -- Basic Results -- Complexity and Inapproximability -- The Best-Out-Of-k Algorithm -- Linear Programming Relaxation -- References
- Extension to General Planar Graphs -- Conclusions -- References -- On a Family of Strong Geometric Spanners That Admit Local Routing Strategies -- Introduction -- The Family G_\lambda^\theta of Graphs -- Location of Destroyers -- The Spanning Ratio of G_\lambda^\theta -- Half-Space Proximal -- Unit Disk Graph Spanners -- Simulation Results -- Conclusion -- References -- Spanners for Geometric Intersection Graphs -- Introduction -- Preliminaries -- Our Contributions -- Modified Yao Graph -- Partitioning the Plane -- Spanners of Disk Graphs -- Algorithmic Version -- Extension to Ball Graphs -- Speeding up on Unit Ball Graphs -- Separators in Spanner Graph -- Approximate Proximity Problems Using Spanner -- References -- On Generalized Diamond Spanners -- Introduction -- Constructing Spanner Paths -- One-Sided Paths -- Two-Sided Paths -- The Final Spanning Ratio -- Triangulations That Have the Diamond Property -- References -- The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces -- Introduction -- Lower Bounds -- Uniform Metric Spaces -- Phase-Based Algorithms for the DR Problem -- Randomized Phase-Based Algorithm for DR Problem -- Uniformly Decomposable Metric Spaces -- References -- On the Robustness of Graham's Algorithm for Online Scheduling -- Introduction -- Arbitrary Perturbations -- Arbitrary Decreases in Processing Time -- Arbitrary Increases in Processing Time -- Bounded Perturbations -- Bounded Decreases in Processing Times -- Bounded Increases in Processing Times -- References -- Improved Results for a Memory Allocation Problem -- Introduction -- NP-Hardness of the Problem (in the strong sense) -- The NEXT FIT Algorithm -- The Structure of the Optimal Packing for k = 2 -- A 7/5-Approximation for k = 2 -- Algorithm Halts in Step 5 -- Critical Items -- Algorithm Halts in Step 3 -- Algorithm Halts in Step 6