Algorithms and Complexity - Info and Reading Options

Google Books:

This book constitutes the refereed proceedings of the 4th Italian Conference on Algorithms and Complexity, CIAC 2000, held in Rome, Italy, in March 2000. The 21 revised full papers presented were carefully reviewed and selected from 41 submissions; also included are four invited survey papers. Among the topics addressed are combinatorial optimization, graph algorithms, graph computations, complexity theory, diagram design, approximation, scheduling, sorting, computational geometry, searching, and pattern matching.

Open Data:

Lecture Notes in Computer Science -- Algorithms and Complexity -- Copyright -- Preface -- Table of Contents -- On Salesmen, Repairmen, Spiders, and Other Traveling Agents -- Computing a Diameter-Constrained Minimum Spanning Tree in Parallel -- Algorithms for a Simple Point Placement Problem -- Duality in ATM Layout Problems -- The Independence Number of Random Interval Graphs -- Online Strategies for Backups -- Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem -- Semantical Counting Circuits★ -- The Hardness of Placing Street Names in a Manhattan Type Map★ -- Labeling Downtown -- The Online Dial-a-Ride Problem under Reasonable Load★ -- The Online-TSP against Fair Adversaries -- QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms -- Triangulations without Minimum-Weight Drawing1 -- Faster Exact Solutions for Max2Sat -- Dynamically Maintaining the Widest k-Dense Corridor -- Reconstruction of Discrete Sets from Three or More X-Rays -- Modified Binary Searching for Static Tables -- An Efficient Algorithm for the Approximate Median Selection Problem -- Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes -- Group Updates for Red-Black Trees -- Approximating SVP∞ to within Almost-Polynomial Factors Is NP-Hard -- Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems★ -- On the Lovász Number of Certain Circulant Graphs -- Speeding Up Pattern Matching by Text Compression -- Author Index

Search for “Algorithms and Complexity” downloads:

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

Find “Algorithms and Complexity” in Libraries Near You:

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

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