Algorithms and Data Structures - Info and Reading Options

Open Data:

Intro -- Title Page -- Preface -- Organization -- Table of Contents -- Finding Small Holes -- Approximate Range Searching: The Absolute Model -- Introduction -- Preliminaries -- Halfspace Range Searching -- Approximate Semigroup Version -- Approximate Idempotent Version -- Exact Idempotent Version -- Halfbox Quadtree -- Approximate Spherical Range Searching -- Approximate Simplex Range Searching -- Other Results -- References -- Orthogonal Range Searching in Linear and Almost-Linear Space -- Introduction -- Range Reporting on the Narrow Grid -- Range Counting Queries on the Narrow Grid -- Two-Dimensional Range Searching -- Two-Dimensional Semi-group Range Counting -- References -- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere -- Introduction -- Locality Sensitive Hashing (LSH) -- Spherical LSH (SLSH) -- Problem Description -- Locality Sensitive Hash Functions Using a Regular Polytope -- The Algorithm -- Performance Evaluation -- Discussion -- Conclusion -- References -- A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity -- Introduction -- Definitions -- Locally Connected Cycles and a New Lower Bound -- Examples -- Overview of the Algorithm -- Virtual Edges -- Algorithm 3EdgeConnect(G) -- Selecting a Target Component -- 2-Connecting a Cycle -- 2-Connecting a Path -- Summary -- References -- Approximating the Maximum Sharing Problem -- Introduction -- Approximating MS: A Special Case -- The Color Path-Cycle Packing Problem (CPCP) -- Solving CPCP -- A 1.5-Approximation for CPP and MS -- A More Practical 1.5-Approximation Algorithm -- Approximating MS: The General Case -- References -- The Stackelberg Minimum Spanning Tree Game -- Introduction -- Basic Results -- Complexity and Inapproximability -- The Best-Out-Of-k Algorithm -- Linear Programming Relaxation -- 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.