# Algorithms and data structures : 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011, proceedings / Frank Dehne, John Iacono, Jörg-Rüdiger Sack (eds.).

Material type: TextSeries: Serienbezeichnung | Lecture notes in computer science ; 6844. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publication details: Berlin ; New York : Springer, ©2011. Description: 1 online resource (xv, 718 pages)Content type: text Media type: computer Carrier type: online resourceISBN: 9783642223006; 3642223001; 9783642222993; 3642222994Other title: WADS 2011Subject(s): Data structures (Computer science) -- Congresses | Computer algorithms -- Congresses | Informatique | Computer algorithms | Data structures (Computer science) | computerwetenschappen | computer sciences | algoritmen | algorithms | computeranalyse | computer analysis | gegevensstructuren | data structures | wiskunde | mathematics | computergrafie | computer graphics | numerieke methoden | numerical methods | computertechnieken | computer techniques | computernetwerken | computer networks | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Algorithms and Data Structures.DDC classification: 005.7/2 LOC classification: QA76.9.D35 | W33 2011Other classification: 54.62 Online resources: Click here to access onlineItem type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|

eBook |
e-Library
Electronic Book@IST |
EBook | Available |

Includes bibliographical references and author index.

Print version record.

Annotation Constituting the refereed proceedings of the 12th Algorithms and Data Structures Symposium held in New York in August 2011, this text presents original research on the theory and application of algorithms and data structures in all areas, including combinatorics, computational geometry and databases.

Machine generated contents note: Piecewise-Linear Approximations of Uncertain Functions / Amirali Khosravi -- Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs / L. Sunil Chandran -- On the Area Requirements of Euclidean Minimum Spanning Trees / Claudio Squarcella -- Multi-target Ray Searching Problems / Konstantinos Panagiotou -- Convex Transversals / Shang Yang -- How to Cover a Point Set with a V-Shape of Minimum Width / Muriel Dulieu -- Witness Rectangle Graphs / Ferran Hurtado -- Faster Optimal Algorithms for Segment Minimization with Small Maximal Value / Maxwell Young -- Orthogonal Cartograms with Few Corners Per Face / Lesvia Elena Ruiz Velazquez -- Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals / B. V. Raghavendra Rao -- Feedback Vertex Set in Mixed Graphs / Daniel Lokshtanov -- Switching to Directional Antennas with Constant Increase in Radius and Hop Distance /

Note continued: Fast Algorithm for Three-Dimensional Layers of Maxima Problem / Yakov Nekrich -- Succinct 2D Dictionary Matching with No Slowdown / Dina Sokol -- PTAS for Densest k-Subgraph in Interval Graphs / Tim Nonner -- Improved Distance Queries in Planar Graphs / Yahav Nussbaum -- Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers / Gabor Tardos -- Faster Algorithms for Minimum-Link Paths with Restricted Orientations / Mikko Sysikaski -- Streaming Algorithms for 2-Coloring Uniform Hypergraphs / Saswata Shannigrahi -- Density-Constrained Graph Clustering / Dorothea Wagner -- MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) Is Light / Shay Solomon -- Theory vs. Practice in the Design and Analysis of Algorithms / Robert E. Tarjan -- Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint (Extended Abstract) / Xiaofan Lai.