## Proceedings of the Fifth Workshop on Algorithm Engineering and ExperimentsThe ALENEX workshop provides a forum for the presentation of original research in the implementation and experimental evaluation of algorithms and data structures. This volume collects extended versions of the 12 papers that were selected for presentation. |

### What people are saying - Write a review

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

### Contents

The Markov Chain Simulation Method for Generating Connected Power Law Random | 16 |

Efficient Exact Geometric Predicates for Delaunay Triangulations | 37 |

Interpolation over Light Fields with Applications in Computer Graphics | 56 |

Practical Construction of Metric fSpanners | 69 |

CacheConscious Sorting of Large Sets of Strings with Dynamic Tries | 93 |

Concepts Design Choices and Practical Considerations | 106 |

On the Implementation of a SwapBased Local Search Procedure for the pMedian | 119 |

141 | |

### Common terms and phrases

Adaptive radixsort applications approach approximation bound bucket burstsort cache CGAL clustering Computational Geometry constraints construction contains core-set corresponding cost cutting stock problem data structure dataset degree sequence Delaunay triangulations Dijkstra's algorithm distance distributions dynamic programming efficient elements equivalence class experiments fast Figure FUNET geometric grid structure heuristic I/Os implementation input instance integer interpolation interval iterations length Markov chain memory method metric space MSD radixsort nodes number of edges optimal output packing paths algorithm pending performance persistent B-tree predicates prefi xes problem Proc query random graph ray-tracing recursive replacement paths requirements retrie retrie-LR rides rotation running sample schedule secs Section segments sets of strings shortest path shortest paths problem shows solution solve sorting sorting algorithms spanners speedup static filter stdev subset Symposium t-Spanner threshold topology train unit type tree trie updates users vertex vertices