



LEADER 
06647nmm a2200457 u 4500 
001 
EB000379195 
003 
EBX01000000000000000232247 
005 
00000000000000.0 
007 
cr 
008 
130626  eng 
020 


a 9783540739517

100 
1 

a Dehne, Frank
e [editor]

245 
0 
0 
a Algorithms and Data Structures
h Elektronische Ressource
b 10th International Workshop, WADS 2007, Halifax, Canada, August 1517, 2007, Proceedings
c edited by Frank Dehne, JörgRüdiger Sack, Norbert Zeh

250 


a 1st ed. 2007

260 


a Berlin, Heidelberg
b Springer Berlin Heidelberg
c 2007, 2007

300 


a XVI, 664 p
b online resource

505 
0 

a Session 1  Finding Small Holes  Session 2A  Approximate Range Searching: The Absolute Model  Orthogonal Range Searching in Linear and AlmostLinear Space  Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere  Session 2B  A 4/3Approximation Algorithm for Minimum 3EdgeConnectivity  Approximating the Maximum Sharing Problem  The Stackelberg Minimum Spanning Tree Game  Session 3A  Edges and Switches, Tunnels and Bridges  How to Draw a Clustered Tree  Drawing Colored Graphs on Colored Points  Session 3B  DiscrepancySensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2d Nearest Neighbors in Any Minkowski Metric  Priority Queues Resilient to Memory Faults  Simple and SpaceEfficient Minimal Perfect Hash Functions  Session 4A  A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane  A Pseudopolynomial Time O(logn)Approximation Algorithm for Art Gallery Problems 

505 
0 

a Branch and Recharge: Exact Algorithms for Generalized Domination  Session 10A  On Computing the Centroid of the Vertices of an Arrangement and Related Problems  Optimal Algorithms for the Weighted pCenter Problems on the Real Line for Small p  Session 10B  Faster Approximation of Distances in Graphs  Approximate Shortest Paths Guided by a Small Index  Session 11A  Initializing Sensor Networks of Nonuniform Density in the Weak Sensor Model  Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field  35/44Approximation for Asymmetric Maximum TSP with Triangle Inequality  On Euclidean Vehicle Routing with Allocation  Session 11B  Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets  Range NonoverlappingIndexing and Successive List Indexing  SpaceEfficient Straggler Identification in RoundTrip Data Streams Via Newton’s Identities and Invertible Bloom Filters  Dynamic TCP Acknowledgment with Sliding Window

505 
0 

a The kResource 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  Session 8A  Computational and Structural Advantages of Circular Boundary Representation  AlphaBeta Witness Complexes  Cauchy’s Theorem and Edge Lengths of Convex Polyhedra  Session 8B  FixedParameter Tractability for NonCrossing Spanning Trees  Improved Algorithms for the Feedback Vertex Set Problems  Kernelization Algorithms for dHitting Set Problems  Session 9A  Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points  Maximizing Maximal Angles for Plane StraightLine Graphs  Cuttings for Disks and AxisAligned Rectangles  Session 9B  Kernelization and Complexity Results for Connectivity Augmentation Problems  An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem 

505 
0 

a Optimization for First Order Delaunay Triangulations  Session 4B  Constant Factor Approximations for the Hotlink Assignment Problem  Approximation Algorithms for the SexEqual Stable Marriage Problem  A Stab at Approximating Minimum Subadditive Join  Session 5  Algorithmic Challenges for SystemsLevel Correlational Analysis: A Tale of Two Datasets  Session 6A  Flooding Countries and Destroying Dams  I/OEfficient Flow Modeling on Fat Terrains  Computing the Visibility Map of Fat Objects  Session 6B  Independent Sets in BoundedDegree Hypergraphs  Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with SinglyExponential Dependence on Epsilon  Computing a MinimumDepth Planar Graph Embedding in O(n 4) Time  Session 7A  On a Family of Strong Geometric Spanners That Admit Local Routing Strategies.Spanners for Geometric Intersection Graphs  On Generalized Diamond Spanners  Session 7B 

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örgRüdiger
e [editor]

700 
1 

a Zeh, Norbert
e [editor]

041 
0 
7 
a eng
2 ISO 6392

989 


b Springer
a Springer eBooks 2005

490 
0 

a Theoretical Computer Science and General Issues

028 
5 
0 
a 10.1007/9783540739517

856 
4 
0 
u https://doi.org/10.1007/9783540739517?nosfx=y
x Verlag
3 Volltext

082 
0 

a 005.11

520 


a 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 UrbanaChampaign) 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
