## Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and CombinatoricsThe 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

Page 16

Sorry, this page's content is restricted.

Sorry, this page's content is restricted.

Page 51

Sorry, this page's content is restricted.

Sorry, this page's content is restricted.

Page 55

Sorry, this page's content is restricted.

Sorry, this page's content is restricted.

Page 95

Sorry, this page's content is restricted.

Sorry, this page's content is restricted.

Page 135

Sorry, this page's content is restricted.

Sorry, this page's content is restricted.

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

An Experimental Study of Point Location in General Planar Arrangements | 16 |

Summarizing Spatial Data Streams Using ClusterHulls | 26 |

DistanceSensitive Bloom Filters | 41 |

An Experimental Study of Old and New Depth Measures | 51 |

The Art of Proximity Searching | 65 |

Using Markov Chains to Design Algorithms for BoundedSpace OnLine Bin Cover | 75 |

8o Data Reduction Exact and Heuristic Algorithms for Clique Cover | 86 |

Fast Reconfiguration of Data Placement in Parallel Disks | 95 |

I85 Deterministic Random Walks | 185 |

Binary Trees Left and Right Paths WKB Expansions and Painlevé Transcendents | 198 |

On the Variance of Quickselect | 205 |

Semirandom Models as Benchmarks for Coloring Algorithms | 211 |

New Results and Open Problems for Deletion Channels | 222 |

Distinct Values Estimators for Power Law Distributions | 230 |

A RandomSurfer WebGraph Model | 238 |

Asymptotic Optimality of the Static Frequency Caching in the Presence of Correlated Requests | 247 |

i08 ForceDirected Approaches to Sensor Localization | 108 |

I19 Compact Routing on Power Law Graphs with Additive Stretch | 119 |

Efficient PointtoPoint Shortest Path Algorithms | 129 |

I44 Distributed Routing in SmallWorld Networks | 144 |

Engineering MultiLevel Overlay Graphs for ShortestPath Queries | 156 |

I7 Optimal Incremental Sorting | 171 |

Exploring the Average Values of Boolean Functions via Asymptotics and Experimentation | 253 |

A Transfer Matrix Approach | 263 |

Random Partitions with Parts in the Range of a Polynomial | 273 |

281 | |

### Common terms and phrases

analysis applications approach approximation bin-states Bloom ﬁlters CC-Heuristic CGAL circulant graphs CLIQUE COVER ClusterHull clusters component Computational Geometry convex hull data depth data sets data structure deﬁned deﬁnition Delaunay triangulation denote density Depth Explorer depth measures Dijkstra’s algorithm disk distance efﬁcient elements Figure ﬁnd ﬁrst ﬁxed given graph distance graph G hash functions heuristic implementation input instances integer L1 depth landmarks layout Lemma lower bound Markov chain method metric Minkowski sum multi-level graph networks nodes NP-hard number of edges number of vertices open bins optimal output overlay graphs parameter performance placement planar maps polynomial polytopes power-law preprocessing probability problem Proc Proof query point quickselect random graph reach recursive rithms round routing sample scanned scheme Section selected sensor shortcuts shortest path speciﬁc speed-up subgraph subset Symposium Table Theorem tion topological sort tree values vertex walk