## 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. |

### 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 |

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

algorithm analysis applications approach approximation arrangement assigned assume average bins bound called clique close clusters complexity component compute connected consider constant construction containing convex cost cover data sets data structure defined demand denote depth direction disk distance distribution edges efficient elements error estimate exact example existing expected experiments face Figure function given graph hulls implementation improve initial input instances landmarks layout Lemma length maps measures method Minkowski sum networks nodes Note observed obtained optimal parameter path performance planar points position practical preprocessing present probability problem Proof query random range reach REAL require respect round routing Rule running sample scheme selected shape shortest path space step stream structure Table takes tasks Theorem tion tree University values vertex vertices walk