Algorithms - ESA 2009

1. Front Matter

   PDF

2. Invited Talk

   1. Some Open Questions Related to Cuckoo Hashing

      • Michael Mitzenmacher

      Pages 1-10

3. Trees

   1. Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks

      • Martin Fürer

      Pages 11-22

   2. Improved Approximation Algorithms for Label Cover Problems

      • Moses Charikar, MohammadTaghi Hajiaghayi, Howard Karloff

      Pages 23-34

   3. A Linear Time Algorithm for L(2,1)-Labeling of Trees

      • Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

      Pages 35-46

4. Geometry I

   1. On Inducing Polygons and Related Problems

      • Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg

      Pages 47-58

   2. Computing 3D Periodic Triangulations

      • Manuel Caroli, Monique Teillaud

      Pages 59-70

   3. Cauchy’s Theorem for Orthogonal Polyhedra of Genus 0

      • Therese Biedl, Burkay Genc

      Pages 71-82

5. Mathematical Programming

   1. Approximability of Sparse Integer Programs

      • David Pritchard

      Pages 83-94

   2. Iterative Rounding for Multi-Objective Optimization Problems

      • Fabrizio Grandoni, R. Ravi, Mohit Singh

      Pages 95-106

   3. A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity

      • Claudia D’Ambrosio, Jon Lee, Andreas Wächter

      Pages 107-118

6. Geometry II

   1. Constructing Delaunay Triangulations along Space-Filling Curves

      • Kevin Buchin

      Pages 119-130

   2. Piercing Translates and Homothets of a Convex Body

      • Adrian Dumitrescu, Minghui Jiang

      Pages 131-142

   3. Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs

      • Khaled Elbassioni, Kazuhisa Makino, Imran Rauf

      Pages 143-154

7. Algorithmic Game Theory I

   1. On Revenue Maximization in Second-Price Ad Auctions

      • Yossi Azar, Benjamin Birnbaum, Anna R. Karlin, C. Thach Nguyen

      Pages 155-166

   2. Clustering-Based Bidding Languages for Sponsored Search

      • Mohammad Mahdian, Grant Wang

      Pages 167-178

   3. Altruism in Atomic Congestion Games

      • Martin Hoefer, Alexander Skopalik

      Pages 179-189

8. Geometry III

   1. Geometric Spanners for Weighted Point Sets

      • Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel Smid

      Pages 190-202

   2. k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees

      • Yuval Emek

      Pages 203-214

   3. Narrow-Shallow-Low-Light Trees with and without Steiner Points

      • Michael Elkin, Shay Solomon

      Pages 215-226

This volume contains the papers presented at ESA 2009: The 17th Annual - ropean Symposium on Algorithms, September 7–9, 2009. ESA has been held annually since 1993, and seeks to cover both theoretical and engineering aspects of algorithms. The authors were asked to classify their paper under one or more categories as described in Fig. 1. Since 2001, ESA has been the core of the larger ALGO conference, which typically includes several satellite conferences. ALGO 2009 was held at the IT University of Copenhagen, Denmark. The ?ve members of the ALGO 2009 - ganizing Committee were chaired by Thore Husfeldt. The ESA submission deadline was April 12, Easter Sunday. This was clearly an error and we o?er profuse apologies for this mistake. Albeit no excuse, the hard constraints we faced were (a) ICALP noti?cation, April 6, and (b) ESA in Copenhagen, September 7. Between these two endpoints we needed to design a schedule that allowed modifying ICALP rejections for resubmission (1 week), Program Committee deliberations (7 weeks), preparing ?nal versions (4 weeks), and, to prepare, publish, and transport the proceedings (9 weeks). ESA 2009had 272submissions ofwhich 14 werewithdrawn overtime. Of the remaining 222 submissions to Track A (Design and Analysis), 56 were accepted. Of the remaining 36 submissions to Track B (Engineering and Applications), 10 were accepted. This gives an acceptance rate of slightly under 25%.

• Scheduling
• algorithmic game theory
• algorithms
• ants
• data compression
• data structure
• data structures
• databases
• hierarchical memories
• information retrieval
• machine learning
• parallel algorithms
• quantum computing
• randomized
• streaming algorithms
• algorithm analysis and problem complexity

• School of Computer Science, Tel Aviv University, Tel Aviv, Israel

  Amos Fiat

• Fakultät für Informatik, Universität Karlsruhe (TH), Karlsruhe, Germany

  Peter Sanders

Policies and ethics