iii

xiii Preface

xiv Acknowledgments

Session 1A

1 Fast Dimension Reduction Using Rademacher Series on Dual BCH CodesNir Ailon and Edo Liberty

10 Estimators and Tail Bounds for Dimension Reduction in lα (0 < α ≤ 2) Using StableRandom ProjectionsPing Li

20 A Deterministic Sub-linear Time Sparse Fourier Algorithm via Non-adaptiveCompressed Sensing MethodsM. A. Iwen

30 Explicit Constructions for Compressed Sensing of Sparse SignalsPiotr Indyk

34 Improved Distance Sensitivity Oracles via Random SamplingAaron Bernstein and David Karger

Session 1B

44 Strongly Polynomial and Fully Combinatorial Algorithms for BisubmodularFunction MinimizationS. Thomas McCormick and Satoru Fujishige

54 Holographic Algorithms with Unsymmetric SignaturesJin-Yi Cai and Pinyan Lu

64 The UGC Hardness Threshold of the �p Grothendieck ProblemGuy Kindler, Assaf Naor, and Gideon Schechtman

74 Succinct Approximate Convex Pareto CurvesIlias Diakonikolas and Mihalis Yannakakis

84 Efficient Reductions among Lattice ProblemsDaniele Micciancio

Session 1C

94 Delaunay Graphs of Point Sets in the Plane with Respect to Axis-ParallelRectanglesXiaomin Chen, János Pach, Mario Szegedy, and Gábor Tardos

102 Greedy Drawings of TriangulationsRaghavan Dhandapani

112 Maintaining Deforming Surface MeshesSiu-Wing Cheng and Tamal K. Dey

CONTENTS

122 Exact and Efficient 2D-Arrangements of Arbitrary Algebraic CurvesArno Eigenwillig and Michael Kerber

132 On Properties of Random Dissections and TriangulationsNicla Bernasconi, Konstantinos Panagiotou, and Angelika Steger

Session 2

142 Graph Algorithms for Biological Systems AnalysisBonnie Berger, Robit Singh, and Jinbo Xu

Session 3A

152 Adaptive Local RatioJulián Mestre

161 Two-Phase Greedy Algorithms for Some Classes of Combinatorial Linear Programs Ulrich Faigle and Britta Peis

167 Analysis of Greedy Approximations with Nonsubmodular Potential FunctionsDing-Zhu Du, Ronald L. Graham, Panos M. Pardalos, Peng-Jun Wan, Weili Wu, and Wenbo Zhao

176 Yet Another Algorithm for Dense Max Cut: Go GreedyClaire Mathieu and Warren Schudy

183 Computing Large Matchings FastIgnaz Rutter and Alexander Wolff

Session 3B

193 A Fractional Model of the Border Gateway Protocol (BGP)P. E. Haxell and G. T. Wilfong

200 Minimizing Average Latency in Oblivious RoutingPrahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, and Jaikumar Radhakrishnan

208 Distributed Broadcast in Unknown Radio NetworksGianluca De Marco

218 The Power of Memory in Randomized BroadcastingRobert Elsässer and Thomas Sauerwald

228 Competitive Queue Management for Latency Sensitive PacketsAmos Fiat, Yishay Mansour, and Uri Nadav

iv Contents

Session 3C

238 Rapid Mixing of Gibbs Sampling on Graphs That Are Sparse on AverageElchanan Mossel and Allan Sly

248 Product Growth and Mixing in Finite GroupsLászló Babai, Nikolay Nikolov, and László Pyber

258 Concatenated Codes Can Achieve List-Decoding CapacityVenkatesan Guruswami and Atri Rudra

268 Noisy Sorting without ResamplingMark Braverman and Elchanan Mossel

277 Algorithms for the Coalitional Manipulation ProblemMichael Zuckerman, Ariel D. Procaccia, and Jeffrey S. Rosenschein

Session 4A

287 On Allocations That Maximize FairnessUriel Feige

294 On the Value of Coordination in Network DesignSusanne Albers

304 Auctions for Structured ProcurementMatthew C. Cary, Abraham D. Flaxman, Jason D. Hartline, and Anna R. Karlin

314 Fast Load Balancing via Bounded Best ResponseBaruch Awerbuch, Yossi Azar, and Rohit Khandekar

323 (Almost) Optimal Coordination Mechanisms for Unrelated Machine SchedulingYossi Azar, Kamal Jain, and Vahab Mirrokni

Session 4B

333 Ultra-low-Dimensional Embeddings for Doubling MetricsT-H. Hubert Chan, Anupam Gupta, and Kunal Talwar

343 Earth Mover Distance over High-Dimensional SpacesAlexandr Andoni, Piotr Indyk, and Robert Krauthgamer

353 Almost Euclidean Subspaces of �1 via Expander CodesVenkatesan Guruswami, James R. Lee, and Alexander Razborov

363 Embedding Metric Spaces in Their Intrinsic DimensionIttai Abraham, Yair Bartal, and Ofer Neiman

373 Optimal Universal Graphs with Deterministic EmbeddingNoga Alon and Michael Capalbo

Contents v

N

Session 4C

379 Fast and Reliable Reconstruction of Phylogenetic Trees with Very Short EdgesIlan Gronau, Shlomo Moran, and Sagi Snir

389 Trace Reconstruction with Constant Deletion Probability and Related ResultsThomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, and Udi Wieder

399 Improved String Reconstruction over Insertion-Deletion ChannelsKrishnamurthy Viswanathan and Ram Swaminathan

409 Dimension Augmentation and Combinatorial Criteria for Efficient Error-ResistantDNA Self-AssemblyHo-Lin Chen, Ashish Goel, and Chris Luhrs

419 Approximating General Metric Distances between a Pattern and a TextEly Porat and Klim Efremenko

Session 5A

428 A Near-Linear Time Algorithm for Computing Replacement Paths in PlanarDirected GraphsYuval Emek, David Peleg, and Liam Roditty

436 Bounded-Leg Distance and Reachability OraclesRan Duan and Seth Pettie

446 A Nearly Linear Time Algorithm for the Half Integral Disjoint Paths PackingKen-ichi Kawarabayashi and Bruce Reed

455 Fast Edge Splitting and Edmonds’ Arborescence Construction for UnweightedGraphsAnand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, and Debmalya Panigrahi

465 Nondecreasing Paths in a Weighted Graph or: How to Optimally Read a TrainScheduleVirginia Vassilevska

Session 5B

473 Broadcast Scheduling: Algorithms and ComplexityJessica Chang, Thomas Erlebach, Renars Gailis, and Samir Khuller

483 Graph Balancing: A Special Case of Scheduling Unrelated Parallel MachinesTomáš Ebenlendr, Marek Krcál, and Jirí Sgall

491 Non-clairvoyant Scheduling with Precedence ConstraintsJulien Robert and Nicolas Schabanel

501 Provably Good Multicore Cache Performance for Divide-and-ConquerAlgorithmsGuy E. Blelloch, Rezaul A. Chowdhury, Phillip B. Gibbons, Vijaya Ramachandran,Shimin Chen, and Michael Kozuch

vi Contents

^^

511 Balls and Bins with Structure: Balanced Allocations on HypergraphsP. Brighten Godfrey

Session 5C

518 Arc-Disjoint In-Trees in Directed GraphsNaoyuki Kamiyama, Naoki Katoh, and Atsushi Takizawa

527 Finding One Tight CycleSergio Cabello, Matt DeVos, Jeff Erickson, and Bojan Mohar

532 Set Connectivity Problems in Undirected Graphs and the Directed SteinerNetwork ProblemChandra Chekuri, Guy Even, Anupam Gupta, and Danny Segev

542 Matroid Intersection, Pointer Chasing, and Young’s Seminormal Representationof SnNicholas J. A. Harvey

550 Iterated Rounding Algorithms for the Smallest k-Edge Connected SpanningSubgraphHarold N. Gabow and Suzanne Gallagher

Session 6

560 Shuffling Cards, Adding Numbers, and Symmetric FunctionsPersi Diaconis

Session 7A

561 On the Bichromatic k-Set ProblemTimothy M. Chan

571 Geodesic Delaunay Triangulation and Witness Complex in the PlaneJie Gao, Leonidas J. Guibas, Steve Y. Oudot, and Yue Wang

581 Minimum Weight Convex Steiner PartitionsAdrian Dumitrescu and Csaba D. Tóth

591 Improved Algorithms for Fully Dynamic Geometric Spanners and GeometricRoutingLee-Ad Gottlieb and Liam Roditty

601 On the Connectivity of Dynamic Random Geometric GraphsJosep Díaz, Dieter Mitsche, and Xavier Pérez-Giménez

Session 7B

611 Improved Algorithmic Versions of the Lovász Local LemmaAravind Srinivasan

621 L(2,1)-Labelling of GraphsFrédéric Havet, Bruce Reed, and Jean-Sébastien Sereni

Contents vii

631 Catalan Structures and Dynamic Programming in H-Minor-Free GraphsFrederic Dorn, Fedor V. Fomin, and Dimitrios M. Thilikos

641 Computing Excluded MinorsIsolde Adler, Martin Grohe, and Stephan Kreutzer

651 An Algorithm for Improving Graph PartitionsReid Andersen and Kevin J. Lang

Session 7C

661 Improved Algorithms for Orienteering and Related ProblemsChandra Chekuri, Nitish Korula, and Martin Pál

671 Approximation Algorithms for Labeling Hierarchical TaxonomiesYuval Rabani, Leonard J. Schulman, and Chaitanya Swamy

681 Fast Approximation of the Permanent for Very Dense ProblemsMark Huber and Jenny Law

690 Approximating TSP on Metrics with Bounded Global GrowthT-H. Hubert Chan and Anupam Gupta

700 Fully Polynomial Time Approximation Schemes for Stochastic Dynamic ProgramsNir Halman, Diego Klabjan, Chung-Lun Li, James Orlin, and David Simchi-Levi

Session 8A

710 On Distributing Symmetric Streaming ComputationsJon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Cliff Stein, and ZoyaSvitkina

720 Tight Lower Bounds for Selection in Randomly Ordered StreamsAmit Chakrabarti, T. S. Jayram, and Mihai Patrascu

730 On Distance to Monotonicity and Longest Increasing Subsequence of a DataStreamFunda Ergun and Hossein Jowhari

737 Declaring Independence via the Sketching of SketchesPiotr Indyk and Andrew McGregor

746 Why Simple Hash Functions Work: Exploiting the Entropy in a Data StreamMichael Mitzenmacher and Salil Vadhan

Session 8B

756 Maximum OverhangMike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, and Uri Zwick

766 Deterministic Random Walks on Regular TreesJoshua Cooper, Benjamin Doerr, Tobias Friedrich, and Joel Spencer

viii Contents

¸

^

773 Quasirandom Rumor SpreadingBenjamin Doerr, Tobias Friedrich, and Thomas Sauerwald

782 Universality of Random GraphsDomingos Dellamonica, Jr., Yoshiharu Kohayakawa, Vojtech Rödl, and AndrzejRucinski

789 The Effect of Induced Subgraphs on Quasi-randomnessAsaf Shapira and Raphael Yuster

Session 8C

799 Clustering for Metric and Non-metric Distance MeasuresMarcel R. Ackermann, Johannes Blömer, and Christian Sohler

809 Metric Clustering via Consistent LabelingRobert Krauthgamer and Tim Roughgarden

819 On Clustering to Minimize the Sum of RadiiMatt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, and KasturiVaradarajan

826 A Constant Factor Approximation Algorithm for k-median Clustering withOutliersKe Chen

836 Geometric Clustering: Fixed-Parameter Tractability and Lower Bounds withRespect to the DimensionSergio Cabello, Panos Giannopoulos, Christian Knauer, and Günter Rote

Session 9A

844 The Complexity of Game Dynamics: BGP Oscillations, Sink Equilibria, and BeyondAlex Fabrikant and Christos H. Papadimitriou

854 Designing Networks with Good EquilibriaHo-Lin Chen, Tim Roughgarden, and Gregory Valiant

864 Ascending Auctions for Integral (Poly)matroids with Concave NondecreasingSeparable ValuesSushil Bikhchandani, Sven de Vries, James Schummer, and Rakesh V. Vohra

874 Fast Algorithms for Finding Proper Strategies in Game TreesPeter Bro Miltersen and Troels Bjerre Sørensen

884 Incentive Compatible Regression LearningOfer Dekel, Felix Fischer, and Ariel D. Procaccia

Session 9B

894 Space-Efficient Dynamic Orthogonal Point Location, Segment Intersection, andRange ReportingGuy E. Blelloch

Contents ix

´

^

904 In-Place 2-D Nearest Neighbor SearchTimothy M. Chan and Eric Y. Chen

912 Distribution-Sensitive Point Location in Convex SubdivisionsSébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, and PatMorin

922 Coresets, Sparse Greedy Approximation, and the Frank-Wolfe AlgorithmKenneth L. Clarkson

932 Sampling Algorithms and Coresets for p RegressionAnirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, and Michael W.Mahoney

Session 9C

942 Stochastic Analyses for Online Combinatorial Optimization ProblemsNaveen Garg, Anupam Gupta, Stefano Leonardi, and Piotr Sankowski

952 Online Make-to-Order Joint Replenishment Model: Primal Dual CompetitiveAlgorithmsN. Buchbinder, T. Kimbrel, R. Levi, K. Makarychev, and M. Sviridenko

962 Parallel Monotonicity ReconstructionMichael Saks and C. Seshadhri

972 Better Bounds for Online Load Balancing on Unrelated MachinesIoannis Caragiannis

982 Online Budgeted Matching in Random Input Models with Applications toAdwordsGagan Goel and Aranyak Mehta

Session 10

992 Computational AdvertisingAndrei Broder

Session 11A

993 Linked Decompositions of Networks and the Power of Choice in Polya UrnsHenry Lin, Christos Amanatidis, Martha Sideri, Richard M. Karp, and Christos H.Papadimitriou

1003 A Local Algorithm for Finding Dense SubgraphsReid Andersen

1010 PageRank and the Random Surfer ModelPrasad Chebolu and Páll Melsted

1019 Charity Auctions on Social NetworksArpita Ghosh and Mohammad Mahdian

x Contents

´

�

1029 On the Approximability of Influence in Social NetworksNing Chen

Session 11B

1038 Fast Asynchronous Byzantine Agreement and Leader Election with FullInformationBruce Kapron, David Kempe, Valerie King, Jared Saia, and Vishal Sanwalani

1048 Unconditionally Reliable Message Transmission in Directed NetworksBhavani Shankar, Prasant Gopal, Kannan Srinathan, and C. Pandu Rangan

1056 A Tight Lower Bound for Parity in Noisy Communication NetworksChinmoy Dutta, Yashodhan Kanoria, D. Manjunath, and JaikumarRadhakrishnan

1066 Ranged Hash Functions and the Price of ChurnJames Aspnes, Muli Safra, and Yitong Yin

1076 Algorithms for Distributed Functional MonitoringGraham Cormode, S. Muthukrishnan, and Ke Yi

Session 11C

1086 Real-Time Indexing over Fixed Finite AlphabetsAmihood Amir and Igor Nor

1096 Finding an Optimal Tree Searching Strategy in Linear TimeShay Mozes, Krzysztof Onak, and Oren Weimann

1106 Dynamic Optimality for Skip Lists and B-TreesProsenjit Bose, Karim Douïeb, and Stefan Langerman

1115 Splay Trees, Davenport-Schinzel Sequences, and the Deque ConjectureSeth Pettie

1125 Fully Dynamic Algorithm for Graph Spanners with Poly-logarithmic Update TimeSurender Baswana and Soumojit Sarkar

Session 12A

1135 SPREAD: An Adaptive Scheme for Redundant and Fair Storage in DynamicHeterogeneous Storage SystemsMario Mense and Christian Scheideler

1145 Price Based Protocols for Fair Resource Allocation: Convergence Time Analysisand Extension to Leontief UtilitiesAshish Goel and Hamid Nazerzadeh

1154 Lower-Bounded Facility LocationZoya Svitkina

1164 A Plant Location Guide for the UnsureBarbara M. Anthony, Vineet Goyal, Anupam Gupta, and Viswanath Nagarajan

Contents xi

1174 Approximating Connected Facility Location Problems via Random FacilitySampling and Core DetouringFriedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, and Guido Schäfer

Session 12B

1184 The Hiring Problem and Lake Wobegon StrategiesAndrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, andSergei Vassilvitskii

1194 Weak ∈-Nets and Interval ChainsNoga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, and ShakharSmorodinsky

1204 Robust Cost ColoringsTakuro Fukunaga, Magnús M. Halldórsson, and Hiroshi Nagamochi

1213 Comparing the Strength of Query Types in Property Testing: The Case of Testingk-ColorabilityIdo Ben-Eliezer, Tali Kaufman, Michael Krivelevich, and Dana Ron

1223 Sampling Stable Marriages: Why Spouse-Swapping Won’t WorkNayantara Bhatnagar, Sam Greenberg, and Dana Randall

Section 12C

1233 On Stars and Steiner StarsAdrian Dumitrescu and Csaba D. Tóth

1241 Cutting Cycles of Rods in Space: Hardness and ApproximationBoris Aronov, Mark de Berg, Chris Gray, and Elena Mumford

1249 Empty-Ellipse GraphsOlivier Devillers, Jeff Erickson, and Xavier Goaoc

1258 Recognizing Partial Cubes in Quadratic TimeDavid Eppstein

1267 Approximating Geometric Coverage ProblemsThomas Erlebach and Erik Jan van Leeuwen

1277 Author Index

xii Contents