Return to home page
Searching: Muskingum library catalog
We are currently experiencing delivery delays for items requested from other institutions while transitioning to a new statewide delivery service. Please contact your library with questions or advice about alternative resources. Thank you for your patience!
  Previous Record Previous Item Next Item Next Record
  Reviews, Summaries, etc...
Conference WADS 2009 (2009 : Banff, Alta.)
Title Algorithms and data structures : 11th international symposium, WADS 2009, Banff, Canada, August 21-23, 2009 ; proceedings / Frank Dehne, Marina Gavrilova, Jorg-Rudiger Sack, Csaba D. Toth (eds.).
Imprint Berlin : Springer, 2009.

View online
View online
Conference WADS 2009 (2009 : Banff, Alta.)
Series Lecture notes in computer science, 0302-9743 ; 5664
Lecture notes in computer science ; 5664.
Subject Data structures (Computer science) -- Congresses.
Computer algorithms -- Congresses.
Information Storage and Retrieval.
Alt Name Dehne, F. (Frank), 1960-
Gavrilova, Marina L.,
Sack, J.-R. (Jörg-Rüdiger), 1954-
Toth, Csaba D.,
Description 1 online resource (x, 580 pages) : illustrations.
Note International conference proceedings.
Bibliography Note Includes bibliographical references and index.
Summary This book constitutes the refereed proceedings of the 11th Algorithms and Data Structures Symposium, WADS 2009, held in Banff, Canada, in August 2009. The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The 49 revised full papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers present original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
Contents Title Page; Preface; Organization; Table of Contents; On the Power of the Semi-Separated Pair Decomposition; Plane Graphs with Parity Constraints; Straight-Line Rectangular Drawings of Clustered Graphs; Online Priority Steiner Tree Problems; Connect the Dot: Computing Feed-Links with Minimum Dilation; Minimal Locked Trees; Approximating Transitive Reductions for Directed Networks; 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2; Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing.
A Distribution-Sensitive Dictionary with Low Space OverheadA Comparison of Performance Measures for Online Algorithms; Delaunay Triangulation of Imprecise Points Simplified and Extended; An Improved SAT Algorithm in Terms of Formula Length; Shortest Path Problems on a Polyhedral Surface; Approximation Algorithms for Buy-at-Bulk Geometric Network Design; Rank-Sensitive Priority Queues; Algorithms Meet Art, Puzzles, and Magic; Skip-Splay: Toward Achieving the Unified Bound in the BST Model; Drawing Graphs with Right Angle Crossings.
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff DistanceEfficient Construction of Near-Optimal Binary and Multiway Search Trees; On the Approximability of Geometric and GeographicGeneralization and the Min-Max Bin Covering Problem; On Reconfiguration of Disks in the Plane and Related Problems; Orientation-Constrained Rectangular Layouts; The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics; Optimal Embedding into Star Metrics; Online Square Packing; Worst-Case Optimal Adaptive Prefix Coding.
New Results on Visibility in Simple PolygonsDynamic Graph Clustering Using Minimum-Cut Trees; Rank-Balanced Trees; Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments; Reconfiguration of List Edge-Colorings in a Graph; The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs; Two for One: Tight Approximation of 2D Bin Packing; Fault Tolerant External Memory Algorithms; Inspecting a Set of Strips Optimally; A Pseudopolynomial Algorithm for Alexandrov's Theorem.
A Scheme for Computing Minimum Covers within Simple RegionsBetter Approximation Algorithms for the Maximum Internal Spanning Tree Problem; Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality; Streaming Embeddings with Slack; Computing the Implicit Voronoi Diagram in Triple Precision; Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms; Integer Programming: Optimization and Evaluation Are Equivalent; Resolving Loads with Positive Interior Stresses; On Making Directed Graphs Transitive.
Note Print version record.
ISBN 9783642033674
OCLC # 437347237
Additional Format Print version: WADS 2009 (2009 : Banff, Alta.). Algorithms and data structures. Berlin : Springer, 2009 9783642033667 3642033660 (OCoLC)430888116

If you experience difficulty accessing or navigating this content, please contact the OPAL Support Team