Proceedings of the eighth workshop on algorithm engineering and experiments and the third workshop on analytic algorithmics and combinatorics

292 Pages·2006·39.19 MB·English

by  Rajeev Raman

PROCEEDINGS OF THE EIGHTH
WORKSHOP ON ALGORITHM
ENGINEERING AND EXPERIMENTS
AND THE THIRD WORKSHOP
ON ANALYTIC ALGORITHMICS
AND COMBINATORICS
SIAM PROCEEDINGS SERIES LIST
Fifth International Conference on Mathematical and Numerical Aspects of Wave Propagation (2000),
Alfredo Bermudez, Dolores Gomez, Christophe Hazard, Patrick Joly, and Jean E. Roberts, editors
Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (2001), S. Rao Kosaraju, editor
Proceedings of the Tenth SIAM Conference on Parallel Processing for Scientific Computing (2001), Charles
Koelbel and Juan Meza, editors
Computational Information Retrieval (2001), Michael Berry, editor
Collected Lectures on the Preservation of Stability under Discretization (2002), Donald Estep and Simon
Tavener, editors
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2003), Martin Farach-
Colton, editor
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (2003), Richard E, Ladner, editor
Fast Algorithms for Structured Matrices: Theory and Applications (2003), Vadim Olshevsky, editor
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2004), Ian Munro, editor
Applied Mathematics Entering the 21st Century: Invited Talks from the ICIAM 2003 Congress (2004), James
M. Hill and Ross Moore, editors
Proceedings of the Fourth SIAM International Conference on Data Mining (2004), Michael W. Berry,
Umeshwar Dayal, Chandrika Kamath, and David Skillicorn, editors
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2005), Adam
Buchsbaum, editor
Mathematics for Industry: Challenges and Frontiers. A Process View: Practice and Theory (2005), David R.
Ferguson and Thomas J. Peters, editors
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (2006), Cliff Stein, editor
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on
Analytic Algorithmics and Combinatorics (2006), Rajeev Raman, Robert Sedgewick, and Matthias F.
Stallmann, editors
Proceedings of the Sixth SIAM International Conference on Data Mining (2006), Joydeep Ghosh, Diane
Lambert, David Skillicorn, and Jaideep Srivastava, editors
PROCEEDINGS OF THE EIGHTH
WORKSHOP ON ALGORITHM
ENGINEERING AND EXPERIMENTS
AND THE THIRD WORKSHOP
ON ANALYTIC ALGORITHMICS
AND COMBINATORICS
Edited by Rajeev Raman, Robert Sedgewick, and Matthias F. Stallmann
S1HJTL
Society for Industrial and Applied Mathematics
Philadelphia
PROCEEDINGS OF THE EIGHTH WORKSHOP
ON ALGORITHM ENGINEERING AND EXPERIMENTS
AND THE THIRD WORKSHOP ON ANALYTIC
ALGORITHMICS AND COMBINATORICS
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, Miami, FL, January 21,
2006
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, Miami, FL, January 21,
2006
The workshop was supported by the ACM Special Interest Group on Algorithms and Computation Theory
and the Society for Industrial and Applied Mathematics.
Copyright © 2006 by the Society for Industrial and Applied Mathematics.
1098765432 1
All rights reserved. Printed in the United States of America. No part of this book may be reproduced,
stored, or transmitted in any manner without the written permission of the publisher. For information, write
to the Society for Industrial and Applied Mathematics, 3600 University City Science Center, Philadelphia,
PA 19104-2688.
Library of Congress Control Number: 2006922417
ISBN 0-89871-610-1
S1HJTL
is a registered trademark.
CONTENTS
vii Preface to the Workshop on Algorithm Engineering and Experiments
ix Preface to the Workshop on Analytic Algorithmics and Combinatorics
Workshop on Algorithm Engineering and Experiments
3 Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications
Efi Fogel and Dan Halperin
16 An Experimental Study of Point Location in General Planar Arrangements
Idit Haran and Dan Halperin
26 Summarizing Spatial Data Streams Using ClusterHulls
John Hershberger, Nisheeth Shrivastava, and Subhash Suri
41 Distance-Sensitive Bloom Filters
Adam Kirsch and Michael Mitzenmacher
51 An Experimental Study of Old and New Depth Measures
John Hugg, Eynat Rafalin, Kathryn Seyboth, and Diane Souvaine
65 Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching
David Mount
66 Implementation and Experiments with an Algorithm for Parallel Scheduling of Complex Dags
under Uncertainty
Grzegorz Malewicz
75 Using Markov Chains to Design Algorithms for Bounded-Space On-Line Bin Cover
Eyjolfur Asgeirsson and Cliff Stein
86 Data Reduction, Exact, and Heuristic Algorithms for Clique Cover
Jens Gramm, Jiong Guo, Falk Huffner, and Rolf Niedermeier
95 Fast Reconfiguration of Data Placement in Parallel Disks
Srinivas Kashyap, Samir Khuller, Yung-Chun (Justin) Wan, and Leana Golubchik
108 Force-Directed Approaches to Sensor Localization
Alon Efrat, David Forrester, Anand Iyer, Stephen G. Kobourov, and Cesim Erten
119 Compact Routing on Power Law Graphs with Additive Stretch
Arthur Brady and Lenore Cowen
129 Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
Andrew V, Goldberg, Haim Kaplan, and Renato F. Werneck
144 Distributed Routing in Small-World Networks
Oskar Sandberg
156 Engineering Multi-Level Overlay Graphs for Shortest-Path Queries
Martin Holzer, Frank Schulz, and Dorothea Wagner
171 Optimal Incremental Sorting
Rodrigo Paredes and Gonzalo Navarro
v
CONTENTS
Workshop on Analytic Algorithmics and Combinatorics
185 Deterministic Random Walks
Joshua Cooper, Benjamin Doerr, Joel Spencer, and Garbor Tardos
198 Binary Trees, Left and Right Paths, WKB Expansions, and Painleve Transcendents
Charles Knessl and Wojciech Szpankowski
205 On the Variance of Quickselect
Jean Daligault and Conrado Martinez
211 Semirandom Models as Benchmarks for Coloring Algorithms
Michael Krivelevich and Dan Vilenchik
222 New Results and Open Problems for Deletion Channels
Michael Mifzenmacher
223 Partial Fillup and Search Time in LC Tries
Svante Janson and Wojciech Szpankowski
230 Distinct Values Estimators for Power Law Distributions
Rajeev Motwani and Sergei Vassilvitskii
238 A Random-Surfer Web-Graph Model
Avrim Blum, T-H. Hubert Chan, and Mugizi Robert Rwebangira
247 Asymptotic Optimality of the Static Frequency Caching in the Presence of Correlated Requests
Predrag R. Jelenkovic and Ana Radovanovic
253 Exploring the Average Values of Boolean Functions via Asymptotics and Experimentation
Robin Pemantle and Mark Daniel Ward
263 Permanents of Circulants: A Transfer Matrix Approach
Mordecai J. Golin, Yiu Cho Leung, and Yajun Wang
273 Random Partitions with Parts in the Range of a Polynomial
William M. Y. Goh and Pawet Hitczenko
281 Author Index
VI
ALENEX WORKSHOP PREFACE
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
and experimental evaluation of algorithms and data structures, ALENEX 2006, the eighth workshop in this
series, was held in Miami, Florida, on January 21, 2006. 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.
These proceedings contain 15 contributed papers presented at the workshop, together with the abstract
of an invited lecture by David Mount, entitled "Keep Your Friends Close and Your Enemies Closer: The Art
of Proximity Searching," The contributed papers were selected from a total of 46 submissions based on
originality, technical contribution, and relevance. Considerable effort was devoted to the evaluation of
the submissions with four reviews or more per paper, It is nonetheless expected that most of the papers in
these proceedings will eventually appear in finished form in scientific journals.
The workshop took place on the same day as the Third Workshop on Analytic Algorithmics and Combinatorics
(ANALCO 2006), and papers from that workshop also appear in these proceedings. As both workshops
are concerned with looking beyond the big-oh asymptotic analysis of algorithms, we hope that the
ALENEX community will find the ANALCO papers to be of interest.
We would like to express our gratitude to all the people who contributed to the success of the workshop.
In particular, we would like thank the authors of submitted papers, the ALENEX Program Committee
members, and the external reviewers, Special thanks go to Adam Buchsbaum for answering our many
questions along the way, to Andrei Voronkov for timely technical assistance with the use of the EasyChair
system, and to Sara Murphy and Sarah M. Granlund for coordinating the production of these proceedings.
Finally, we are indebted to Kirsten Wilden, for all of her valuable help in the many aspects of organizing
this workshop.
Rajeev Raman and Matt Stallmann
ALENEX 2006 Program Committee
Ricardo Baeza-Yates, UPF, Barcelona, Spain and University of Chile, Santiago
Luciana Buriol, University of Rome "La Sapienza," Italy
Thomas Erlebach, University of Leicester, United Kingdom
Irene Finocchi, University of Rome "La Sapienza," Italy
Roberto Grossi, University of Pisa, Italy
Lutz Kettner, Max Planck Institute for Informatics, Saarbrucken, Germany
Eduardo Sany Laber, PUC, Rio de Janeiro, Brazil
Alex Lopez-Ortiz, University of Waterloo, Canada
Stefan Naher, University of Trier, Germany
Rajeev Raman (co-chair), University of Leicester, United Kingdom
Peter Sanders, University of Karlsruhe, Germany
Matt Stallmann (co-chair), North Carolina State University
lleana Streinu, Smith College
Thomas Willhalm, Intel, Germany
ALENEX 2006 Steering Committee
Lars Arge, University of Aarhus Richard E. Ladner, University of Washington
Roberto Battiti, University of Trento Catherine C. McGeoch, Amherst College
Adam Buchsbaum, AT&T Labs—Research Bernard M.E. Moret, University of New Mexico
Camil Demetrescu, University of Rome "La Sapienza" David Mount, University of Maryland, College Park
Andrew V. Goldberg, Microsoft Research Jack Snoeyink, University of North Carolina,
Michael T. Goodrich, University of California, Irvine Chapel Hill
Giuseppe F. Italiano, University of Rome, "Tor Vergata" Clifford Stein, Columbia University
David S, Johnson, AT&T Labs—Research Roberto Tamassia, Brown University
vii
ALENEX WORKSHOP PREFACE
ALENEX 2006 External Reviewers
Ernst Althaus Gad M. Landau
Spyros Angelopolous Marcelo Mas
Lars Arge Steffen Mecke
Jeremy Barbay Andreas Meyer
Michael Baur Ulrich Meyer
Luca Becchetti Gabriel Moruz
Iwona Bialynicka-Birula David Mount
Brona Brejova Carlos Oliveira
Saverio Caminiti Anna Ostlin Pagh
Timothy Chan Maurizio Patrignani
Valentina Ciriani Seth Pettie
Carlos Cotta Derek Phillips
Roman Dementiev Sylvain Pion
Camil Demetrescu Maurizio Pizzonia
Reza Dorrigiv Marcus Poggi
Mitre Dourado Fabio Protti
Arash Farzan Claude-Guy Quimper
Gereon Frahling Romeo Rizzi
G. Franceschini Salvator Roura
Stefan Funke Marie-France Sagot
Marco Gaertler Guido Schaefer
Emilio Di Giacomo Dominik Schultes
Robert Gorke Frank Schulz
Peter Hachenberger Ingolf Sommer
Michael Hoffmann Siang Wun Song
Martin Holzer Renzo Sprugnoli
Daniel Huson Eduardo Uchoa
Juha Karkkainen Ugo Vaccaro
Martin Kutz
VIII
ANALCO WORKSHOP PREFACE
The papers in this proceedings, along with an invited talk by Michael Mitzenmacher on "New Results and
Open Problems for Deletion Channels," were presented at the Third Workshop on Analytic Algorithmics
and Combinatorics (ANALCO06), which was held in Miami on January 21, 2006. The aim of ANALCO is
to provide a forum for the presentation of original research in the analysis of algorithms and associated
combinatorial structures. The papers study properties of fundamental combinatorial structures that arise
in practical computational applications (such as permutations, trees, strings, tries, and graphs) and
address the precise analysis of algorithms for processing such structures, including average-case analysis;
analysis of moments, extrema, and distributions; and probabilistic analysis of randomized algorithms. Some
of the papers present significant new information about classic algorithms; others present analyses of new
algorithms that present unique analytic challenges, or address tools and techniques for the analysis of
algorithms and combinatorial structures, both mathematical and computational.
The workshop took place on the same day as the Eighth Workshop on Algorithm Engineering and
Experiments (ALENEX06); the papers from that workshop are also published in this volume. Since
researchers in both fields are approaching the problem of learning detailed information about the
performance of particular algorithms, we expect that interesting synergies will develop, People in the
ANALCO community are encouraged to look over the ALENEX papers for problems where the analysis
of algorithms might play a role; people in the ALENEX community are encouraged to look over these
ANALCO papers for problems where experimentation might play a role.
ANALCO 2006 Program Committee
Jim Fill, Johns Hopkins University
Mordecai Golin, Hong Kong University of Science and Technology
Philippe Jacquet, INRIA, France
Claire Kenyon, Brown University
Colin McDiarmid, University of Oxford
Daniel Panario, Carleton University
Robert Sedgewick (chair), Princeton University
Alfredo Viola, University of Uruguay
Mark Ward, Purdue University
ANALCO 2006 Steering Committee
Philippe Flajolet, INRIA, France
Robert Sedgewick, Princeton University
Wojciech Szpankowski, Purdue University
IX