PROCEEDINGS OF THE

TWENTY-FIFTH ANNUAL

ACM-SIAM SYMPOSIUM

ON DISCRETE ALGORITHMS

Association for Computing Machinery

Society for Industrial and Applied Mathematics

New York

Philadelphia

Table of Contents

Session 1A

A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median 1

Mohammadtaghi Hajiaghayi; Wei Hu; Jian Li; Shi Li; Barna Saha

Improved Approximation Algorithm for Two-Dimensional Bin Packing 13

Arindam Khan; Nikhil Bansal

A Mazing 2+eps Approximation for Unsplittable Flow on a Path 26

Aris Anagnostopoulos; Fabrizio Grandoni; Stefano Leonardi; Andreas Wiese

Better Approximation Bounds for the Joint Replenishment Problem 42

Marcin Bienkowski; Jarek Byrka; Marek Chrobak; Lukasz Jez; Dorian Nogneng;

Jiri Sgall

Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy

Approach 55

Nikhil Bansal; Moses Charikar; Ravishankar Krishnaswamy; Shi Li

Session IB

An Excluded Grid Theorem for Digraphs with Forbidden Minors 72

Ken-ichi Kawarabayashi; Stephan Kreutzer

Finding small patterns in permutations in linear time 82

Sylvain Guillemot; Daniel Marx

Minimum Common String Partition Parameterized by Partition Size is Fixed-

Parameter Tractable 102

Laurent Bulteau; Christian Komusiewicz

Interval Deletion is Fixed-Parameter Tractable 122

Yixin Cao; Daniel Marx

Efficient Computation of Representative Sets with Applications in Parameterized

and Exact Algorithms 142

Fedor Fomin; Daniel Lokshtanov; Saket Saurabh

Session 1C

On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank 152

Herbert Edelsbrunner; Salman Parsa

Implicit Manifold Reconstruction 161

Siu-Wing Cheng; Man-Kwun Chiu

//'/

Approximating Local Homology from Samples

Primoz Skraba; Bei Wang

174

Robust Satisfiability of Systems of Equations 193

Peter Franek; Marek Krcai

Solving 1-LapIacians of Convex Simplicial Complexes in Nearly Linear Time:

Collapsing and Expanding a Topological Ball 204

Michael B Cohen; Brittany Terese Fasy; Gary L Miller; AmirNayyeri; Richard Peng;

Noel Walkington

Session 2A

An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected

Graphs, and its Multicommodity Generalizations 217

Jonathan Kelner; Yin Tat Lee; Lorenzo Orecchia; Aaron Sidford

Computing Cut-Based Hierarchical Decompositions in Almost Linear Time 227

Harald Racke; Chintan Shah; Hanjo Taubig

Near Linear Time Approximation Schemes for (incapacitated and Capacitated

b—Matching Problems in Nonbipartite Graphs 239

Kook Jin Aim; Sudipto Guha

Improved bounds and algorithms for graph cuts and network reliability 259

David Harris; Aravind Srinivasan

Towards (1+C) -Approximate Flow Sparsifiers 279

Alexandr Andoni; Anupam Gupta; Robert Krauthgamer

Session 2B

Uniform random sampling of simple branched coverings of the sphere by itself 294

Enrica Duchi; Dominique Poulalhon; Gilles Schaeffer

MCMC sampling colourings and independent sets of G(n,d/n) near uniquenessthreshold 305

Charilaos Efthymiou

Arboricity and spanning-tree packing in random graphs with an application to load

balancing 317

Pu Gao; Xavier Perez Gimenez; Cristiane M. Sato

Clustering and Mixing Times for Segregation Models on Z2 327

Prateek Bhakta; Sarah Miracle; Dana Randall

A Simple FPTAS for Counting Edge Covers 341

Chengyu Lin; Jingcheng Liu; Pinyan Lu

iv

Session 2C

Space complexity of list //-coloring: a dichotomy 349

Laszlo Egri; Pavol Hell; Benoit Larose; Arash Rafiey

Positivity Problems for Low-Order Linear Recurrence Sequences 366

Joel Ouaknine; James Worrell

Polynomial solvability of variants of the trust-region subproblem 380

Daniel Bienstock; Alexander Michalka

On the Lattice Isomorphism Problem 391

Ishay Haviv; Oded Regev

The Complexity of Order Type Isomorphism 405

Greg Aloupis; John Iacono; Stefan Langerman; Ozgur Ozkan; Stefanie Wuhrer

Session 3A

Dynamic Task Allocation in Asynchronous Shared Memory 416

Dan Alistarh; James Aspnes; Michael Bender; Rati Gelashvili; Seth Gilbert

Competitive Analysis via Regularization 436

Niv Buchbinder; Shahar Chen; Joseph (Seffi) Naor

First-Come-First-Served for Online Slot Allocation and Huffman Coding 445

Monik Khare; Claire Mathieu; Neal Young

Online Steiner Tree with Deletions 455

Anupam Gupta; Amit Kumar

Maintaining Assignments Online: Matching, Scheduling, and Flows 468

Anupam Gupta; Amit Kumar; Clifford Stein

Session 3B

(Nearly) Sample-Optimal Sparse Fourier Transform 480

Piotr Indyk; Michael Kapralov; Eric Price

Learning Sparse Polynomial Functions 500

Alexandr Andoni; Rina Panigrahy; Gregory Valiant; Li Zhang

Learning Entangled Single-Sample Gaussians 511

Flavio Chierichetti; Anirban Dasgupta; Ravi Kumar; Silvio Lattanzi

Exploiting Metric Structure for Efficient Private Query Release 523

Zhiyi Huang; Aaron Roth

v

On the compatibility of quartet trees 535

Noga Alon; Sagi Snir; Raphael Yuster

Session 3C

A New Perspective on Vertex Connectivity 546

Keren Censor-Hillel; Mohsen Ghaffari; Fabian Kuhn

Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity 562

Yutaro Yamaguchi

Independent Set in Ps-Free Graphs in Polynomial Time 570

Daniel Lokshtanov; Martin Vatshelle; Yngve Villanger

Large induced subgraphs via triangulations and CMSO 582

Fedor Fomin; loan Todinca; Yngve Villanger

Counting thin subgraphs via packings faster than meet-in-the-middle time 594

Andreas Bjorklund; Petteri Kaski; Lukasz Kowalik

Session 4A

Polynomial time approximation schemes for the traveling repairman and other

minimum latency problems 604

Rene Sitters

Approximating Ar-center in planar graphs 617

Philip Klein; David Eisenstat; Claire Mathieu

A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage 628

Constantinos Daskalakis; Anindya De; I lias Diakonikolas; Ankur Moitra;

Rocco Servedio

A QPTAS for Maximum Weight Independent Set of Polygons with

Polylogarithmically Many Vertices 645

Anna Adamaszek; Andreas Wiese

On the optimality of approximation schemes for the classical scheduling problem 657

Lin Chen; Klaus Jansen; Guochuan Zhang

Session 4B

Improved Concentration Bounds for Count-Sketch 669

Gregory T. Minton; Eric Price

Annotations for Sparse Data Streams 687

Amit Chakrabarti; Graham Cormode; Navin Goyal; Justin Thaler

vi

Relative Errors for Deterministic Low-Rank Matrix ApproximationsMina Ghashami; Jeff Phillips

707

An Optimal Lower Bound for Distinct Elements in the Message Passing Model 718

David Woodruff; Qin Zhang

Approximating matching size from random streams 734

Michael Kapralov; Sanjeev Khanna; Madhu Sudan

Session 4C

Intrinsic universality in tile self-assembly requires cooperation 752

Pierre-Etienne Meunier; Matthew Patitz; Scott Summers; Guillaume Theyssier;

Andrew Winslow; Damien Woods

Timing in chemical reaction networks 772

David Doty

Faster Agreement via a Spectral Method for Detecting Malicious Behavior 785

Valerie King; Jared Saia

Tight Bounds for Rumor Spreading with Vertex Expansion 801

George Giakkoupis

Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids 816

Martin Dietzfelbinger; Philipp Woelfel

Session 5A

Polynomiality for Bin Packing with a Constant Number of Item Types 830

Michel X. Goemans; Thomas Rothvoss

Integer quadratic programming in the plane 840

Alberto Del Pia; Robert Weismantel

Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost

to time ratio cycles 847

Thomas Dueholm Hansen; Haim Kaplan; Uri Zwick

Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via

Poincare Recurrence 861

Georgios Piliouras; Jeff S. Shamma

Improved upper bounds for Random-Edge and Random-Jump on abstract cubes 874

Thomas Dueholm Hansen; Mike Paterson; Uri Zwick

v/7

Session 5B

Smoothed Analysis of Local Search for the Maximum-Cut Problem 882

Michael Etscheid; Heiko Roglin

Bilu—Linial Stable Instances of Max Cut and Minimum Multiway Cut 890

Konstantin Makarychev; Yury Makarychev; Aravindan Vijayaraghavan

A constructive algorithm for the Lovasz Local Lemma on permutations 907

David Harris; Aravind Srinivasan

Pipage Rounding, Pessimistic Estimators and Matrix Concentration 926

Nicholas Harvey; Neil Olver

Maximizing Social Influence in Nearly Optimal Time 946

Christian Borgs; Jennifer Chayes; Michael Brautbar; Brendan Lucier

Session 5C

Cache-Adaptive Algorithms 958

Michael A. Bender; Roozbeh Ebrahimi; Jeremy T. Fineman; Golnaz Ghasemiesfeh;Rob Johnson; Samuel McCauley

Near-optimal labeling schemes for nearest common ancestors 972

Stephen Alstrup; Esben Halvorsen; Kasper Larsen

Concurrent Range Reporting in Two-Dimensional Space 983

Peyman Afshani; Cheng Sheng; Yufei Tao; Bryan T. Wilkinson

Selection and Sorting in the "Restore" Model 995

Timothy M. Chan; J. Ian Munro; Venkatesh Raman

Disjoint Set Union with Randomized Linking 1005

Ashish Goel; Sanjeev Khanna; Daniel Larkin; Robert Tarjan

Session 6A

Beyond Locality-Sensitive Hashing 1018

Alexandr Andoni; Piotr Indyk; Huy Nguyen; Ilya Razenshteyn

Cutting corners cheaply, or how to remove Steiner points 1029

Lior Kamma; Robert Krauthgamer; Huy L. Nguyen

Better Approximation Algorithms for the Graph Diameter 1041

Shiri Chechik; Daniel H. Larkin; Liam Roditty; Grant Schoenebeck;Robert E. Tarjan; Virginia Vassilevska Williams

via

A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths 1053

Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai

Fault Tolerant Approximate BFS Trees 1073

Merav Parter; David Peleg

Session 6B

New Approximations for Reordering Buffer Management 1093

Sungjin Im; Benjamin Moseley

Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and

Boundary Condition Constraints 1112

T-H. Hubert Chan; Fei Chen; Xiaowei Wu; Zhichao Zhao

Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms 1123

Nikhil R. Devanur; Zhiyi Huang

Hallucination Helps: Energy Efficient Virtual Circuit Routing 1141

Antonios Antoniadis; Sungjin Im; Ravishankar Krishnaswamy; Benjamin Moseley;

Viswanath Nagarajan; Kirk Pruhs; Cliff Stein

Improvements and Generalizations of Stochastic Knapsack and Multi-Armed

Bandit Approximation Algorithms: Extended Abstract 1154

Will Ma

Session 6C

Hereditary properties of permutations are strongly testable 1164

Tereza Klimosova; Daniel Krai

Testing equivalence between distributions using conditional samples 1174

Clement Canonne; Dana Ron; Rocco Servedio

Optimal Algorithms for Testing Closeness of Discrete Distributions 1193

Siu On Chan; Ilias Diakonikolas; Gregory Valiant; Paul Valiant

Testing Surface Area 1204

Pravesh Kothari; Amir Nayyeri; Ryan O'Donnell; Chenggang Wu

A Cubic Algorithm for Computing Gaussian Volume 1215

Ben Cousins; Santosh Vempala

Session 7A

Non-Uniform Graph Partitioning 1229

Robert Krauthgamer; Seffi Naor; Roy Schwartz; Kunal Talwar

be

Approximation Algorithm for Sparsest Ar-Partitioning 1244

Anand Louis; Konstantin Makarychev

Partitioning into Expanders 1256

Shayan Oveis Gharan; Luca Trevisan

Flow-Based Algorithms for Local Graph Clustering 1267

Lorenzo Orecchia; Zeyuan Allen Zhu

Streaming Balanced Graph Partitioning for Random Graphs 1287

Isabelle Stanton

Session 7B

The Complexity of Optimal Mechanism Design 1302

Constantinos Daskalakis; Alan Deckelbaum; Christos Tzamos

The Complexity of Optimal Multidimensional Pricing 1319

Xi Chen; llias Diakonikolas; Dimitris Paparas; Xiaorui Sun; Mihalis Yannakakis

On Computability of Equilibria in Markets with Production 1329

Jugal Garg; Vijay Vazirani

Constrained Signaling in Auction Design 1341

Shaddin Dughmi; Nicole Immorlica; Aaron Roth

Prophet Inequalities with Limited Information 1358

Pablo Azar; Robert Kleinberg; S. Matthew Weinberg

Session 7C

A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter

Dimension 1378

Esther Ezra

Optimal Determistic Shallow Cuttings for 3D Dominance Ranges 1389

Peyman Afshani; Konstantinos Tsakalidis

Four Soviets Walk the Dog—with an Application to Alt's Conjecture 1399

Kevin Buchin; Maike Buchin; Wouter Meulemans; Wolfgang Mulzer

Fast Computation of Output Sensitive Maxima in a Word RAM 1414

Peyman Afshani

Making Octants Colorful and Related Covering Decomposition Problems 1424

Jean Cardinal; Kolja Knauer; Piotr Micek; Torsten Ueckerdt

x

Session 8A

Submodular Maximization with Cardinality Constraints 1433

Niv Buchbinder; Moran Feldman; Joseph Naor; Roy Schwartz

Approximation Algorithms for Stochastic Boolean Function Evaluation and

Stochastic Submodular Set Cover 1453

Amol Deshpande; Lisa Hellerstein; Devorah Kletenik

Maximizing Bisubmodular and A-Submodular Functions 146S

Justin Ward; Stanislav Zivny

Influence Maximization in Undirected Networks 1482

Sanjeev Khanna; Brendan Lucier

Fast algorithms for maximizing submodular functions 1497

Ashwinkumar Badanidiyuru; Jan Vondrak

Session 8B

New constructions of RIP matrices with fast multiplication and fewer rows 1515

Jelani Nelson; Eric Price; Mary Wootters

Model-based Sketching and Recovery with Expanders 1529

Bubacarr Bah; Luca Baldassarre; Volkan Cevher

Approximation-Tolerant Model-Based Compressive Sensing 1544

Chinmay Hegde; Piotr Indyk; Ludwig Schmidt

On Sketching Matrix Norms and the Top Singular Vector 1562

Yi Li; Huy Nguyen; David Woodruff

Bicriteria data compression 1582

Andrea Farruggia; Paolo Ferragina; Antonio Frangioni; Rossano Venturini

Session 8C

Point Line Cover: The Easy Kernel is Essentially Tight 1596

Stefan Kratsch; Saurabh Ray; Geevarghese Philip

Hardness of Finding Independent Sets in 2-Colorable and Almost 2-CoIorable

Hypergraphs 1607

Subhash Khot; Rishi Saket

Parameters of Two-Prover-One-Round Game and The Hardness of ConnectivityProblems 1626

Bundit Laekhanukit

xi

Hypercontractive inequalities via SOS, and the Frankl-Rodl graph

Manuel Kauers; Ryan O'Donnell; Li-Yang Tan; Yuan Zhou

1644

Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of

Random Graphs 1659

Ryan O'Donnell; John Wright; Chenggang Wu; Yuan Zhou

Session 9A

The Generalized Terminal Backup Problem 1678

Attila Bernath; Yusuke Kobayashi

Approximating Minimum Cost Connectivity Orientation and Augmentation 1687

Mohit Singh; Laszlo A. Vegh

Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial

Connected Dominating Set Problems 1702

Samir Khuller; Manish Purohit; Kanthi Sarpatwar

Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and

Hypergraphs 1714

Wang Chi Cheung; Michel Goemans; Sam Chiu-wai Wong

Minimum {/-dimensional arrangement with fixed points 1727

Anupam Gupta; Anastasios Sidiropoulos

Session 9B

Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts 1739

M.S. Ramanujan; Saket Saurabh

Linear-Time FPT Algorithms via Network Flow 1749

Yoichi Iwata; Keigo Oka; Yuichi Yoshida

Half-integrality, LP-branching and FPT Algorithms 1762

Magnus Wahlstrom

Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number

ofTerminals (and Extensions) 1782

Rajesh Chitnis; Mohammadtaghi Hajiaghayi; Daniel Mane

A Near-Optimal Planarization Algorithm 1802

Bart M. P. Jansen; Daniel Lokshtanov; Saket Saurabh

A subexponential parameterized algorithm for Subset TSP on planar graphs 1812

Philip Klein; Daniel Marx

xii

Session 9C

Broadcast Throughput in Radio Networks: Routing vs. Network Coding 1831

Noga Alon; Mohsen Ghaffari; Bernhard Haeupler; Majid Khabbazian

Causal Erasure Channels 1844

Raef Bassily; Adam Smith

Optimal rate list decoding offolded algebraic-geometric codes over constant-sized

alphabets 1858

Venkatesan Guruswami; Chaoping Xing

Finding orthogonal vectors in discrete structures 1867

Ryan Williams; Huacheng Yu

Efficient quantum protocols for XOR functions 1878

Shengyu Zhang

xiii