Edited by Ian Munro, Robert Sedgewick, Dorothea Wagner, and Wojciech Szpankowski
Proceedings in Applied Mathematics 129
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, tuning, and experimental evaluation of algorithms and data structures. ALENEX 2008, the tenth workshop in this series, was held in San Francisco, California on January 19, 2008. 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.
Preface to the Workshop on Algorithm Engineering and Experiments; Preface to the Workshop on Analytic Algorithmics and Combinatorics; Compressed Inverted Indexes for In-Memory Search Engines; SHARC: Fast and Robust Unidirectional Routing; Obtaining Optimal k-Cardinality Trees Fast; Implementing Partial Persistence in Object-Oriented Languages; Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-period Newsvendor Problem; Routing in Graphs with Applications to Material Flow Problems; How Much Geometry It Takes to Reconstruct a 2-Manifold in 3; Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing; Better Approximation of Betweenness Centrality Decoupling the CGAL 3D Triangulations from the Underlying SpaceConsensus Clustering Algorithms: Comparison and Refinement; Shortest Path Feasibility Algorithms: An Experimental Evaluation; Ranking Tournaments: Local Search and a New Algorithm; An Experimental Study of Recent Hotlink Assignment Algorithms; Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs; On the Convergence of Upper Bound Techniques for the Average Length of Longest Common Subsequences; Markovian Embeddings of General Random Strings; Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform; Bloom Maps; Augmented Graph Models for Small-World Analysis with Geographical Factors; Exact Analysis of the Recurrence Relations Generalized from the Tower of Hanoi; Generating Random Derangements; On the Number of Hamilton Cycles in Bounded Degree Graphs; Analysis of the Expected Number of Bit Comparisons Required by Quickselect; Author Index
2008 / Approx. x + 257 pages / Softcover / ISBN: 978-0898716-53-5
List Price $143.50 / Member Price $100.45 / Order Code PR129