2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX)

Each link below is to a PDF of the paper as it was submitted. Papers are listed in program order. PDF file names represent the Proceedings (ALX and year 10), followed by order in printed version (e.g. 001) and first author's first initial and last name. ISBN: 978-0-898719-31-4

Preface

1          Fast Local Search for Steiner Trees in Graphs
            Eduardo Uchoa and Renato F. Werneck

11        Exact Solutions and Bounds for General Art Gallery Problems
            Tobias Baumgartner, Sándor P. Fekete, Alexander Kröller, and Christiane Schmidt

23        A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem
            Stefan Canzar, Khaled Elbassioni, and Julián Mestre

34        Implementation and Parallelization of a Reverse-Search Algorithm for Minkowski Sums
            Christophe Weibel

43        Simple and Fast Nearest Neighbor Search
            Marcel Birn, Manuel Holtgrewe, Peter Sanders, and Johannes Singler

55        Algorithm Engineering – An Attempt at a Definition Using Sorting as an Example
            Peter Sanders

62        Tabulation Based 5-Universal Hashing and Linear Probing
            Mikkel Thorup and Yin Zhang

77        Conjunctive Filter: Breaking the Entropy Barrier
            Daisuke Okanohara and Yuichi Yoshida

84        Succinct Trees in Practice
            Diego Arroyuelo, Rodrigo Cánovas, Gonzalo Navarro, and Kunihiko Sadakane

98        Employing (1 – ε) Dominating Set Partitions as Backbones in Wireless Sensor Networks
            Dhia Mahjoub and David W. Matula

112      Budgeted Maximum Coverage with Overlapping Costs: Monitoring the Emerging Infections Network
            Donald E. Curtis, Sriram V. Pemmaraju, and Philip Polgreen

124      Route Planning with Flexible Objective Functions
            Robert Geisberger, Moritz Kobitzsch, and Peter Sanders

138      Navigation in Real-World Complex Networks through Embedding in Latent Spaces
            Xiaomeng Ban, Jie Gao, and Arnout van de Rijt

149      Implementing Streaming Simplification for large Labeled Meshes
            Catalin Constantin, Shawn Brown, and Jack Snoeyink

159      Untangling the Braid: Finding Outliers in a Set of Streams
            Chiranjeeb Buragohain, Luca Foschini, and Subhash Suri

173      StreamKM++: A Clustering Algorithms for Data Streams
            Marcel R. Ackermann, Christian Lammersen, Marcus Märtens, Christoph Raupach, Christian Sohler, and
            Kamil Swierkot



Renew SIAM · Contact Us · Site Map · Join SIAM · My Account
Facebook Twitter Flickr Youtube