Algorithms and data structures : 11th international symposium, WADS 2009, Banff, Canada, August 21-23, 2009 ; proceedings / Frank Dehne, Marina Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth (eds.).
Contributor(s): Dehne, F. (Frank) [editor.] | Gavrilova, Marina L [editor.] | Sack, J.-R. (Jörg-Rüdiger) [editor.] | Tóth, Csaba D [editor.]Material type: TextSeries: SerienbezeichnungLecture notes in computer science: 5664.Publisher: Berlin : Springer, 2009Description: 1 online resource (x, 580 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783642033674; 3642033679; 3642033660; 9783642033667Subject(s): Data structures (Computer science) -- Congresses | Computer algorithms -- Congresses | Algorithms | Information Storage and Retrieval | Data structures (Computer science) | Computer algorithms | Informatique | Computer algorithms | Data structures (Computer science)Genre/Form: Congress. | Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Algorithms and data structures.DDC classification: 005.7/3 LOC classification: QA76.9.D35 | W333 2009Other classification: 54.62 | TP311. 12-532 | TP301. 6-532 Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
International conference proceedings.
Includes bibliographical references and index.
Print version record.
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.
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.