Yossi Azar Thomas Erlebach (Eds.)

Algorithms -ESA 2006

14th Annual European Symposium Zürich, Switzerland, September 11 - 13, 2006 Proceedings

Sprin ger

Table of Contents

Invited Lectures

Origami, Linkages, and Polyliedra: Folding with Algorithms 1 Erik D. Dernaine

Reliablc and Efficient Geometrie Computing 2 Kurt Mehlhorn

Some Computational Challenges in Today's Bio-medicine 3 Ron Sharnir

Contributed Papers : Design and Analysis Track

Kinetic Collision Detection for Convex Fat Objects 4 U.A. Abam, M. de Berg, S.-H. Poon, B. Speckmann

Dynamic Connectivity for Axis-Parallel Rectangles 16 Peyman Afshani, Timothy M. Chan

Single Machine Precedence Constiained Scheduling Is a Vertex Cover Problem 28

Christoph Ambiihl, Monaldo Mastrolilli

Cooperativc TSP 40 Arnitai Arrnon, Adi Avidor, Oded Schwartz

Frechet Distancc for Curves, Revisited 52 Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wong, Carola, Wenk

Resource Allocation in Boundcd Degrce Trees 64 Reuven Bar- Yehuda, Micha,el Beder. Yuval Cohen, Dror Rawitz

Dynamic Algorithms for Graph Spanners 76 Surender Baswana,

Latency Constrained Aggregation in Sensor Networks 88 Luca Becchetti, Peter Korteweg. Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti

XIV Table of Contents

Competitive Analysis of Flash-Memory Algorithms 100 Avraham Ben-Aroya, Sivan Toledo

Contention Resolution with Heterogeneous Job Sizes 112 Michael A. Bender, Jeremy T. Fineman, Seth Gilbert

Deciding Relaxed Two-Colorability—A Hardness Jump 124 Robert Berke, Tibor Szabö

Negative Examples for Scquential Importancc Sampling of Binary Contingency Tablcs 135

Ivona Bezäkovä, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda

Estimating Entropy ovcr Data Streams 148 Lakshminath Bhuvanagiri. Sumit Ganguly

Necklaces, Convolutions, and X + Y 160 David Brernner. Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John lacono, Stefan Langerman, Perouz Taslakian

Purely Functional WorstCase Constant Time Catenable Sorted Lists 172 Gerth St0lting Brodal. 'Ghristos Makris, Kostas Tsichlas

Taxes for Linear Atomic Congestion Games 184 loannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos

Spanners with Stack igg T.-II. Hubert Chan, Michael Dinitz, Anupam Gupta

Compressed Indexes for Approximate String Matelüng 208 Ho-Leung Chan, Tak-Wah Lam, Wing-Kin Sung, Siu-Lung Tarn, Sviee-Seong Wong

Traversing the Machining Graph 220 Danny Z. Chen, Rudolf Fleischer, Jian Li, Haüao Wang, Hang Zhu

Efficieiit Compatation of Nash Eqiiilibria for Vcry Sparse Win-Lose Bimatrix Games 232

Bruno Codenotti, Mauro Leoncini, Gwvanni Resta

Distributcd Almost Exact Approximations for Minor-Closed Families 244 Andrzej Czygrinow, Michal Harickowiak

Spcctral Clustering by Recursive Partitioning 256 Anirban Das gupta, John Hopc.roft, Ravi Kannan, Pradipta Mitra

Table of Contents XV

Finite Tcnnination of "Angmenting Path" Algoritlims in thc Presence of Irrational Problem Data 268

Brian C. Dean, Michel X. Goemans, Nicole Jmmorlica

Dynamic Programming and Fast Matrix Multiplication 280 Frederic Dorn

Near-Entropy Hotlink Assigmnents 292 Karirn Doui'eb, Stefan Langerman

Subspace Sampling and Relativc-Error Matrix Approximation: Column-Row-Based Metbads 304

Petros Drineas, Michael W. Mahoney, S. Muthukrishnan

Findrag Total Unimodularity in Optimization Problems Solved by Linear Programs 315

Christoph Dürr. Mathilde Hurand

Preemptive Online Scheduling: Optimal Algorithm« for All Speeds 327 Tomas Ebenlendr, Wojciech Jawor, Jifi Sgall

On the Complexity of thc Multiplication Method for Monotone CNF/DNF Dualization 340

Khaled M. Elbassioni

Lower and Upper Bounds on FIFO Buffer Management in QoS Switches 352

Matthias Erigiert. Matthias Westermxmn

Graph Coloring with Rejection 364 Leah Epstein, Asaf Levin, Gerhard J. Woeginger

A Doubling Dimension Threshold 0 (log log n) for Äugmented Graph Navigability 37g

Pierre Fraigniaud, Emmanuelle Lehhar, Zvi Lotker

Violator Spaces: Structure and Algoritlims 387 Bernd Gärtner, Jifi Ma.tousek, Leo Rüst, Petr Skovron

Region-Restricted Clustering for Geographie Data Mining 399 Joachim Gudmundsson, Marc van Kreveld, Gin Na.rasimhan

An 0(n3(loglogn/logn)5 'M) Time Algorithm for All Pairs Sliortest Paths 411

Yijie Hau

XVI Table of Contents

Cheating by Men in the Gale-Shapley Stahle Matching Algorithm 418 Ghien-Chung Huang

Approximating Almost All Instances of M A X - C U T Within a Ratio Abovc the Hästad Threshold 432

A.C. Kaporis, L.M. Kirousis. E.G. Stavropoulos

Emimeratiiig Spanning and Connected Subscts in Graphs and Matroids 444

L. Khachiyan, E. Boras, K. Bory.s. K. Elbassioni, V. Gurmch, K. Makino

Less Hashing, Same Performance: Building a Better Bloom Filter 456 Adam Kirsch, Michael Mitzenmacher

A. Unified Approach to Approximating Partial Covering Problems 468

Jochen Könemann, Ojas Parekh, Do.nny Segev

Navigating Low-Dimensional and Hierarchical Population Networks 480

Ravi Kurnar, David Liben-Nowell, Andrew Tomkins

Populär Matchings in the Capacitated House Allocation Problem 492 David F. Manlove, Colin T.S. Sng

Inner-Product Based Wavelet Synopse« for R.ange-Sum Querics -504 Yossi Matias, Daniel Urieli

Approximation in Preemptivo Stochastic Online Scheduling 516 Nicole Megow, Tjark Vredeveld

Greedy in Approximation Algorithms 528 Julian Mestre

I/O-Efßcient Undirected Shortest Paths with Unbounded Edge Lengths 540

Ulrich Meyer. Norbert Zeh

Stochastic Shortest Paths Via Qnasi-convcx Maxhmza.tion 552 Evdokia Nikolova, Jonathan A. Keiner, Matthew Brand, Michael Mitzenmacher

Path Hitting in Acyclic Graphs 564 Ojas Parekh, Danny Segev

Tatale of Contents XVII

Minimum Transversals in Posi-modular Systems 576 Manko Sakashita, Kazuhisa Makino. Hiroshi Nagamochi, Satoru Fujishige

An LP-Designed Algoritlim Cor Constraint Satisfaction 588 Alexander D. Scott, Gregory B. Sorkin

Approximate fc-Stciner Forests Via, the Lagrangian Relaxation Technique with Internal Preprocessing 600

Danny Segev, Gil Segev

Balancing Applied to Maximum Network Flow Problems 612 Robert, Tarjan, Julie Ward, Bin Zhang, Yunhong Zhou, Jia Mao

Contributed Papers : Engineering and Applications Track

Out-of-Order Event Processing in Kmetic Data Structures 624 Mohammad Ali Abarn, Pankaj K. Agarwal. Mark de Berg, Hai Yu

Kinetic Algorithms Via Self-adjuKting Computation 636 Umut A. Acar, Guy E. Bleiloch, Kanal Tangwongsan, Jorge L. Vittes

Parallel Machiiie Scbeduling Through Column Generation: Miihmax Objective Functions 648

J.M. van den Akker, J.A. Hoogeveen, J. W. van Kempen

Reporting Flock Patterns 660 Marc Benkert, Joachim Gudmundsson, Florian Hübner, Thomas Wolle

On Exact Algorithms for Trecwidth 672 Hans L. Bodlaender, Fedor V. Fom.in, Arie M.C.A. Koster, Dieter Kratäch, Diw.itrios M. Thüikos

An Improved Constmction for Counting Bloom Filters 684 Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese

An MINLP Solution Method for a Water Network Problem 696 Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth

XVIII Table of Contents

Skewed Binary Seaxcli Trees 708 Gerth St0Üing Brodal, Gabriel Moruz

Algorithmic Aspects of Proportional Symbol Maps 720 S. Cabello. H. Haverkort, M. van Kreveld, B. Speckmann

Does Path Gleaning Help in Dynamic All-Pairs Shortest Paths? 732 C. Demetreseu, P. Faruolo, G.F. Italiano, M. Thorup

Multiline Addressing by Network Flow 744 Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu

The Engineering of a Comprcssion Boosting Library: Thcory VK Practice in BWT Compr&ssion 756

Paolo Ferragma, Raffaele Giancario, Giovanni Manzini

The Price of Resilicncy: A Casc Study on Sorting with Memory Eaults 768

Umberto Fermro-Petrillo, Irene Finocchi, Giuseppe F. Italiano

How Branch Mispredictions Affect Quicksort 780 Kanela Kaligosi, Peter Sanders

Robust, Generie and Efficient Construction of Envelopes of Surfaces in Thrcc-Dimensional Spaces 792

Michal Meyerovitch

Engineering Highway Hierarchics , . 804 Peter Sanders, Dominik Sehultes

Univariate Polynomial Real Root Isolation: Continued Fractions Revisited 817

Elias P. Tsigaridas, Ioannis Z. Emiris

Exact and Efficient Construction of Planar Minkowski Sums Using the Convohition Mcthod 829

Ron Wein

Author Index 841