Algorithms and data structures : 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001 : proceedings

Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8–10, 2001 Proceedings
Author: Frank Dehne, Jörg-Rüdiger Sack, Roberto Tamassia
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42423-9
DOI: 10.1007/3-540-44634-6

Table of Contents:

• Approximation of Multiobjective Optimization Problems
• Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs
• Optimal Möbius Transformations for Information Visualization and Meshing
• Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
• On the Complexity of Scheduling Conditional Real-Time Code
• Time Responsive External Data Structures for Moving Points
• Voronoi Diagrams for Moving Disks and Applications
• Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
• Deciding Clique-Width for Graphs of Bounded Tree-Width
• Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions
• Optimization over Zonotopes and Training Support Vector Machines
• Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
• Seller-Focused Algorithms for Online Auctioning
• Competitive Analysis of the LRFU Paging Algorithm
• Admission Control to Minimize Rejections
• Secure Multi-party Computational Geometry
• The Grid Placement Problem
• On the Reflexivity of Point Sets
• A 7/8-Approximation Algorithm for Metric Max TSP
• Approximating Multi-objective Knapsack Problems

Includes bibliographical references and index