Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and CombinatoricsRajeev Raman, Robert Sedgewick, Matthias F. Stallmann SIAM, 2006 M01 1 - 281 pages The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation and experimental evaluation of algorithms and data structures. The workshop was sponsored by SIAM, the Society for Industrial and Applied Mathematics, and SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory. The aim of ANALCO is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures. |
From inside the book
Try this search over all volumes: convex
Results 1-0 of 0
Contents
An Experimental Study of Point Location in General Planar Arrangements | 16 |
DistanceSensitive Bloom Filters | 41 |
The Art of Proximity Searching | 65 |
Data Reduction Exact and Heuristic Algorithms for Clique Cover | 86 |
ForceDirected Approaches to Sensor Localization | 108 |
Efficient PointtoPoint Shortest Path Algorithms | 129 |
Distributed Routing in SmallWorld Networks | 144 |
Optimal Incremental Sorting | 171 |
Deterministic Random Walks | 185 |
Binary Trees Left and Right Paths WKB Expansions and Painlevé Transcendents | 198 |
Semirandom Models as Benchmarks for Coloring Algorithms | 211 |
Distinct Values Estimators for Power Law Distributions | 230 |
Asymptotic Optimality of the Static Frequency Caching in the Presence of Correlated Requests | 247 |
A Transfer Matrix Approach | 263 |
281 | |
Common terms and phrases
analysis applications approximation arrangement bin-states Bloom filters CC-Heuristic CGAL circulant graphs CLIQUE COVER Cluster Hull component Computational Geometry convex hull data depth data sets data structure defined denote density Depth Explorer depth measures Dijkstra's algorithm disk distance efficient elements Figure fixed-parameter tractability given graph G hash functions heuristic implementation input instances integer item distribution k-median Kleinberg's L1 depth landmarks layout Lemma lower bound Markov chain metric Minkowski sum MSDR multi-level graph networks nodes NP-hard number of edges number of vertices open bins optimal overlay graphs parameter performance placement planar maps polynomial polytopes power-law preprocessing probability problem Proc query point quickselect random graph reach recursive rithms round routing sample scanned scheme Section selected sensor shortcuts shortest path Shuffle method speed-up subgraph subset Symposium Table Theorem tion topological sort tree values vertex walk