Algorithms and Computation - Info and Reading Options

Open Data:

Intro -- Title Page -- Preface -- Organization -- Table of Contents -- Invited Talk -- Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array? -- Some Constrained Notions of Planarity -- Reachability Problems on Directed Graphs -- 1A Approximation Algorithm I -- Greedy Construction of 2-Approximation Minimum Manhattan Network -- Introduction -- Preliminaries -- Algorithm Description -- Approximation Analysis -- References -- The Complexity of Minimum Convex Coloring -- Introduction -- Hardness Results -- Exact Algorithms -- Approximation Algorithms -- References -- On the Complexity of Reconfiguration Problems -- Introduction -- PSPACE-Completeness -- \sc{Power Supply Reconfiguration} -- Other Intractable Reconfiguration Problems -- Reconfiguration Problems in P -- Approximation -- Open Problems -- References -- Multiobjective Disk Cover Admits a PTAS -- Introduction -- Definitions -- PTAS for Multiobjective Disk Cover -- Non-approximability of the Restricted Version -- References -- 1B Online Algorithm -- Data Stream Algorithms via Expander Graphs -- Introduction -- Testing k-Sparsity -- Sparsity Separator Structure -- Algorithm for Testing k-Sparsity -- Deterministic Estimation of Frequency Vector -- References -- Improving the Competitive Ratio of the Online OVSF Code Assignment Problem -- Introduction -- Preliminaries -- Algorithm \sc{Extended-Lazy} -- Executions of \sc{Extended-Lazy} for a-Requests -- Executions of \sc{Extended-Lazy} for r-Requests -- Competitive Analyses of \sc{Extended-Lazy} -- A Lower Bound -- References -- Optimal Key Tree Structure for Deleting Two or More Leaves -- Introduction -- Preliminaries -- Degree Bound for the k-Deletion Problem -- Degree Bound for 2-Deletion Problem -- Optimal Structure of 2-Deletion Problem -- Conclusion -- References

Search for “Algorithms and Computation” downloads:

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

Find “Algorithms and Computation” in Libraries Near You:

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

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