Algorithms and Data Structures - Info and Reading Options

Open Data:

Title Page -- Preface -- Organization -- Table of Contents -- Piecewise-Linear Approximations of Uncertain Functions -- Introduction -- The min-k Problem -- The min-ε Problem -- References -- A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs -- Introduction -- Preliminaries -- Notations -- A Vertex Numbering Scheme for Circular Arc Graphs -- Computing the Boxicity of Co-bipartite CA Graphs in Polynomial Time -- Reducing the Time Complexity of Computing the Boxicity of Co-bipartite CA Graphs -- Constant Factor Approximation for the Boxicity of CA Graphs -- Additive 2-Factor Approximation for the Boxicity of Normal CA Graphs -- References -- On the Area Requirements of Euclidean Minimum Spanning Trees -- Introduction -- Preliminaries -- Geometric Lemmata -- Angles and Edge Lengths in MST Embeddings -- The Proof of the Area Bound -- Conclusions -- References -- Multi-target Ray Searching Problems -- Introduction -- Ray Search in the Full-Information Model -- Ray-Search in the Partial-Information Model -- Intrinsic Cost of Multi-target Search -- A O(logm)-Competitive Algorithm -- An Asymptotically Optimal Multi-target Search Algorithm -- Conclusions -- References -- Convex Transversals -- Introduction -- Hardness Results -- Stabbing Segments in the Plane is NP-Hard -- Extensions -- Stabbing Disjoint Segments and Convex Pseudodisks -- Convexification -- Stabbing with Vertices of a Regular Polygon -- Polynomial-Time Algorithm -- Optimization Problem: Symmetry with Imprecision -- References -- How to Cover a Point Set with a V-Shape of Minimum Width -- Introduction -- Reduction to Canonical V-Shapes -- Computing a Canonical Minimum-Width V-Shape -- A 13-Approximation Algorithm -- Minimum-Width V-Shape for Points on Two Lines -- A (1 + ε)-Approximation Algorithm -- Concluding Remarks -- References

Search for “Algorithms and Data Structures” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Algorithms and Data Structures” in Libraries Near You:

Read or borrow “Algorithms and Data Structures” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Algorithms and Data Structures” at a library near you.