Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Schloss Dagstuhl
←
→
Page content transcription
If your browser does not render page correctly, please read the page content below
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA Edited by Eric Blais Klaus Jansen José D. P. Rolim David Steurer L I P I c s – Vo l . 1 1 6 – A P P R OX / R A N D O M 2 0 1 8 www.dagstuhl.de/lipics
Editors
Eric Blais Klaus Jansen
University of Waterloo University of Kiel
Waterloo, Canada Kiel, Germany
eric.blais@uwaterloo.ca kj@informatik.uni-kiel.de
Jośe Rolim David Steurer
University of Geneva Cornell University
Geneva, Switzerland New York, USA
Jose.Rolim@unige.chr dsteurer@cs.cornell.edu
ACM Classification 2012
Mathematics of computing, Theory of computation
ISBN 978-3-95977-085-9
Published online and open access by
Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern,
Germany. Online available at http://www.dagstuhl.de/dagpub/978-3-95977-085-9 .
Publication date
August, 2018
Bibliographic information published by the Deutsche Nationalbibliothek
The Deutsche Nationalbibliothek lists this publication in the Deutsche Nationalbibliografie; detailed
bibliographic data are available in the Internet at http://dnb.d-nb.de.
License
This work is licensed under a Creative Commons Attribution 3.0 Unported license (CC-BY 3.0):
http://creativecommons.org/licenses/by/3.0/legalcode.
In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the work
under the following conditions, without impairing or restricting the authors’ moral rights:
Attribution: The work must be attributed to its authors.
The copyright is retained by the corresponding authors.
Digital Object Identifier: 10.4230/LIPIcs.APPROX-RANDOM.2018.0
ISBN 978-3-95977-085-9 ISSN 1868-8969 http://www.dagstuhl.de/lipics0:iii
LIPIcs – Leibniz International Proceedings in Informatics
LIPIcs is a series of high-quality conference proceedings across all fields in informatics. LIPIcs volumes
are published according to the principle of Open Access, i.e., they are available online and free of charge.
Editorial Board
Luca Aceto (Chair, Gran Sasso Science Institute and Reykjavik University)
Susanne Albers (TU München)
Christel Baier (TU Dresden)
Javier Esparza (TU München)
Michael Mitzenmacher (Harvard University)
Madhavan Mukund (Chennai Mathematical Institute)
Anca Muscholl (University Bordeaux)
Catuscia Palamidessi (INRIA)
Raimund Seidel (Saarland University and Schloss Dagstuhl – Leibniz-Zentrum für Informatik)
Thomas Schwentick (TU Dortmund)
Reinhard Wilhelm (Saarland University)
ISSN 1868-8969
http://www.dagstuhl.de/lipics
APPROX/RANDOM 2018Contents
Preface
Eric Blais, Klaus Jansen, José D. P. Rolim, and David Steurer . . . . . . . . . . . . . . . . . . xi
Program Committees
................................................................................. xiii
External Reviewers
................................................................................. xv
List of Authors
................................................................................. xvii
Regular Papers
Contributed Talks of APPROX
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, and
Meirav Zehavi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1:1–1:15
Improved Approximation Bounds for the Minimum Constraint Removal Problem
Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, and Kasturi Varadarajan . . . 2:1–2:19
A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees
Amariah Becker . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3:1–3:15
Low Rank Approximation in the Presence of Outliers
Aditya Bhaskara and Srivatsan Kumar . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4:1–4:16
Greedy Bipartite Matching in Random Type Poisson Arrival Model
Allan Borodin, Christodoulos Karavasilis, and Denis Pankratov . . . . . . . . . . . . . . . . . . 5:1–5:15
Semi-Direct Sum Theorem and Nearest Neighbor under `∞
Mark Braverman and Young Kun Ko . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6:1–6:17
Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows
Vladimir Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff, and
Samson Zhou . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7:1–7:22
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs
Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, and
Daniel Vaz . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8:1–8:19
Perturbation Resilient Clustering for k-Center and Related Problems via LP
Relaxations
Chandra Chekuri and Shalmoli Gupta . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9:1–9:16
Sherali-Adams Integrality Gaps Matching the Log-Density Threshold
Eden Chlamtáč and Pasin Manurangsi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10:1–10:19
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
(APPROX/RANDOM 2018).
Editors: Eric Blais, Klaus Jansen, José D. P. Rolim, and David Steurer
Leibniz International Proceedings in Informatics
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany0:vi Contents
Lower Bounds for Approximating Graph Parameters via Communication
Complexity
Talya Eden and Will Rosenbaum . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11:1–11:18
Communication Complexity of Correlated Equilibrium with Small Support
Anat Ganor and Karthik C. S. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12:1–12:16
On Minrank and the Lovász Theta Function
Ishay Haviv . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13:1–13:15
Online Makespan Minimization: The Power of Restart
Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, and Yuhao Zhang . . . 14:1–14:19
On Sketching the q to p Norms
Aditya Krishnan, Sidhanth Mohanty, and David P. Woodruff . . . . . . . . . . . . . . . . . . . . . 15:1–15:20
Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained
Scheduling Models
Janardhan Kulkarni and Shi Li . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16:1–16:21
Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices
Amit Levi and Yuichi Yoshida . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17:1–17:19
Deterministic Heavy Hitters with Sublinear Query Time
Yi Li and Vasileios Nakos . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18:1–18:18
On Low-Risk Heavy Hitters and Sparse Recovery Schemes
Yi Li, Vasileios Nakos, and David P. Woodruff . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19:1–19:13
Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced
Separator and Uniform Sparsest Cut
Pasin Manurangsi and Luca Trevisan . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20:1–20:17
Deterministic O(1)-Approximation Algorithms to 1-Center Clustering with
Outliers
Shyam Narayanan . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21:1–21:19
Robust Online Speed Scaling With Deadline Uncertainty
Goonwanth Reddy and Rahul Vaze . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22:1–22:17
Multi-Agent Submodular Optimization
Richard Santiago and F. Bruce Shepherd . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23:1–23:20
Generalized Assignment of Time-Sensitive Item Groups
Kanthi Sarpatwar, Baruch Schieber, and Hadas Shachnai . . . . . . . . . . . . . . . . . . . . . . . . 24:1–24:18
On Geodesically Convex Formulations for the Brascamp-Lieb Constant
Suvrit Sra, Nisheeth K. Vishnoi, and Ozan Yıldız . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25:1–25:15
Tensor Rank is Hard to Approximate
Joseph Swernofsky . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26:1–26:9
An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with
Soft Capacity
Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, and
Kunihiko Sadakane . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27:1–27:14Contents 0:vii
Fixed-Parameter Approximation Schemes for Weighted Flowtime
Andreas Wiese . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28:1–28:19
Contributed Talks of RANDOM
List-Decoding Homomorphism Codes with Arbitrary Codomains
László Babai, Timothy J. F. Black, and Angela Wuu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29:1–29:18
Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources
Salman Beigi, Andrej Bogdanov, Omid Etesami, and Siyao Guo . . . . . . . . . . . . . . . . . 30:1–30:15
Adaptive Lower Bound for Testing Monotonicity on the Line
Aleksandrs Belovs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31:1–31:10
Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region
Antonio Blanca, Zongchen Chen, and Eric Vigoda . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32:1–32:18
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random
Regular Graphs
Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Štefankovič,
Eric Vigoda, and Kuan Yang . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33:1–33:15
Polar Codes with Exponentially Small Error at Finite Block Length
Jarosław Błasiok, Venkatesan Guruswami, and Madhu Sudan . . . . . . . . . . . . . . . . . . . . 34:1–34:17
Approximate Degree and the Complexity of Depth Three Circuits
Mark Bun and Justin Thaler . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35:1–35:18
Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given
Degree Sequence
Corrie Jacobien Carstens and Pieter Kleer . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36:1–36:18
Randomness Extraction in AC0 and with Small Locality
Kuan Cheng and Xin Li . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37:1–37:20
Boolean Function Analysis on High-Dimensional Expanders
Yotam Dikstein, Irit Dinur, Yuval Filmus, and Prahladh Harsha . . . . . . . . . . . . . . . . . 38:1–38:20
Percolation of Lipschitz Surface and Tight Bounds on the Spread of Information
Among Mobile Agents
Peter Gracar and Alexandre Stauffer . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39:1–39:17
Flipping out with Many Flips: Hardness of Testing k-Monotonicity
Elena Grigorescu, Akash Kumar, and Karl Wimmer . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40:1–40:17
How Long Can Optimal Locally Repairable Codes Be?
Venkatesan Guruswami, Chaoping Xing, and Chen Yuan . . . . . . . . . . . . . . . . . . . . . . . . . 41:1–41:11
On Minrank and Forbidden Subgraphs
Ishay Haviv . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42:1–42:14
Preserving Randomness for Adaptive Algorithms
William M. Hoza and Adam R. Klivans . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43:1–43:19
Commutative Algorithms Approximate the LLL-distribution
Fotis Iliopoulos . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44:1–44:20
APPROX/RANDOM 20180:viii Contents
The Cover Time of a Biased Random Walk on a Random Regular Graph of Odd
Degree
Tony Johansson . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45:1–45:14
Satisfiability and Derandomization for Small Polynomial Threshold Circuits
Valentine Kabanets and Zhenjian Lu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46:1–46:19
High Order Random Walks: Beyond Spectral Gap
Tali Kaufman and Izhar Oppenheim . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47:1–47:17
Improved Composition Theorems for Functions and Relations
Sajin Koroth and Or Meir . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48:1–48:18
Round Complexity Versus Randomness Complexity in Interactive Proofs
Maya Leshkowitz . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49:1–49:16
Improved List-Decodability of Random Linear Binary Codes
Ray Li and Mary Wootters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50:1–50:19
Sunflowers and Quasi-Sunflowers from Randomness Extractors
Xin Li, Shachar Lovett, and Jiapeng Zhang . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51:1–51:13
Torpid Mixing of Markov Chains for the Six-vertex Model on Z2
Tianyu Liu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52:1–52:15
On the Testability of Graph Partition Properties
Yonatan Nakar and Dana Ron . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53:1–53:13
On Closeness to k-Wise Uniformity
Ryan O’Donnell and Yu Zhao . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54:1–54:19
Pseudo-Derandomizing Learning and Approximation
Igor Carboni Oliveira and Rahul Santhanam . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55:1–55:19
Luby–Veličković–Wigderson Revisited: Improved Correlation Bounds and
Pseudorandom Generators for Depth-Two Circuits
Rocco A. Servedio and Li-Yang Tan . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56:1–56:20
Randomly Coloring Graphs of Logarithmically Bounded Pathwidth
Shai Vardi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57:1–57:19
Explicit Strong LTCs with Inverse Poly-Log Rate and Constant Soundness
Michael Viderman . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58:1–58:14Preface
This volume contains the papers presented at the 21st International Workshop on Approxim-
ation Algorithms for Combinatorial Optimization Problems (APPROX 2018) and the 22nd
International Workshop on Randomization and Computation (RANDOM 2018), which took
place concurrently at the at University of Princeton in Princeton, USA during August 20–22,
2018.
APPROX focuses on algorithmic and complexity issues surrounding the development
of efficient approximate solutions to computationally difficult problems, and was the 21st
in the series after Aalborg (1998), Berkeley (1999), Saarbrücken (2000), Berkeley (2001),
Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006),
Princeton (2007), Boston (2008), Berkeley (2009), Barcelona (2010), Princeton (2011),
Boston (2012), Berkeley (2013), Barcelona (2014), Princeton (2015), Paris (2016), and
Berkeley (2017). RANDOM is concerned with applications of randomness to computational
and combinatorial problems, and was the 22nd workshop in the series following Bologna
(1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002),
Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007),
Boston (2008), Berkeley (2009), Barcelona (2010), Princeton (2011), Boston (2012), Berkeley
(2013), Barcelona (2014), Princeton (2015), Paris (2016), and Berkeley (2017).
Topics of interest for APPROX and RANDOM are: approximation algorithms, hardness
of approximation, small space, sub-linear time and streaming algorithms, online algorithms,
approaches that go beyond worst case analysis, distributed and parallel approximation, em-
beddings and metric space methods, mathematical programming methods, spectral methods,
combinatorial optimization in graphs and networks, algorithmic game theory, mechanism
design and economics, computational geometric problems, approximate learning, design and
analysis of randomized algorithms, randomized complexity theory, pseudorandomness and
derandomization, random combinatorial structures, random walks/Markov chains, expander
graphs and randomness extractors, probabilistic proof systems, random projections and em-
beddings, error-correcting codes, average-case analysis, smoothed analysis, property testing,
computational learning theory, and other applications of approximation and randomness.
The volume contains 28 contributed papers, selected by the APPROX Program Committee
out of 50 submissions, and 30 contributed papers, selected by the RANDOM Program
Committee out of 73 submissions.
We would like to thank all of the authors who submitted papers, the invited speakers,
the members of the Program Committees, and the external reviewers. We gratefully acknow-
ledge the Cheriton School of Computer Science of the University of Waterloo in Canada,
the Department of Computer Science of the Christian-Albrechts-Universität zu Kiel, the
Department of Computer Science of the University of Geneva, and the School of Operations
Research and Information Engineering of the Cornell University.
August 2018 Eric Blais, Klaus Jansen
José D. P. Rolim, and David Steurer
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RAN-
DOM 2018).
Editors: Eric Blais, Klaus Jansen, José D. P. Rolim, and David Steurer
Leibniz International Proceedings in Informatics
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, GermanyOrganization
Program Committees
APPROX 2018
Alina Ene Boston University, USA
Fabrizio Grandoni IDSIA, Swiss
Anupam Gupta Carnegie Mellon University, USA
Pravesh Kothari Princeton University, USA and the Institute for Advanced
Study USA
Lap Chi Lau University of Waterloo, Canada
Euiwoong Lee Simons Institute, USA
James Lee University of Washington, USA
Edo Liberty Amazon SageMaker, USA
Yury Makarychev Toyota Technological Institute at Chicago, USA
Neil Olver Vrije Universiteit Amsterdam, The Netherlands
Yuval Rabani the Hebrew University of Jerusalem, Israel
Tselil Schramm Theory of Computation at Harvard, USA
Roy Schwartz Institute of Technology, Israel
Noah Stephens-Davidowitz Princeton University, USA
David Steurer (chair) ETH Zürich, Switzerland
Inbal Talgam-Cohen Institute of Technology, Israel
Aravindan Vijayaraghavan Northwestern University, USA
Justin Ward Queen Mary University of London, United Kingdom
Tony Wirth University of Melbourne, Australia
Grigory Yaroslavtsev Indiana University Bloomington, USA
RANDOM 2018
Eric Blais (chair) University of Waterloo, Canada
Joshua Brody Swarthmore College, USA
Xi Chen Columbia University, USA
Gil Cohen Princeton University, USA and Tel Aviv University, Israel
Andrew Drucker University of Chicago, USA
Tom Gur University of California, Berkeley, USA
Daniel Kane University of California, San Diego, USA
Pravesh Kothari Princeton University, USA and the Institute for Advanced
Study USA
Reut Levi Weizmann Institute, Israel
Aleksandar Nikolov University of Toronto, Canada
Lev Reyzin University of Illinois at Chicago, USA
Noga Ron-Zewi University of Haifa, Israel
Ron Rosenthal Technion, Institute of Technology, Israel
Atri Rudra University at Buffalo, USA
Or Sheffet University of Alberta, Canada
Thomas Watson University of Memphis, USA
Yuichi Yoshida National Institute of Informatics, Japan
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
(APPROX/RANDOM 2018).
Editors: Eric Blais, Klaus Jansen, José D. P. Rolim, and David Steurer
Leibniz International Proceedings in Informatics
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, GermanyExternal Reviewers
Jayadev Acharya Uriya First
Matthew Anderson Benjamin Fish
Haris Angelidakis Felix Fischer
Sepehr Assadi Kyle Fox
Chen Avin Zachary Friggstad
Haim Avron Waldo Gálvez
Pranjal Awasthi Shashwat Garg
Kyriakos Axiotis Sumegha Garg
Oren Becker Dmitry Gavinsky
Shalev Ben-David Badih Ghazi
Huck Bennett Amin Gohari
Mario Berta Elazar Goldenberg
Amey Bhangale Sasha Golovnev
Aditya Bhaskara Catherine Greenhill
Sayan Bhattacharya Elena Grigorescu
Vijay Bhattiprolu Ofer Grossman
Markus Blaeser Anna Gundert
Jarosław Błasiok Heng Guo
Greg Bodwin Guru Guruganesh
Martin Böhm Hamed Hassani
Andrej Bogdanov Jonathan Hermon
Thomas Bosman Matty Hoban
Adam Bouland William Holland
Clément Canonne Samuel Hopkins
Marco Carmosino Kaave Hosseini
Karthekeyan Chandrasekaran Sihuang Hu
Eshan Chattopadhyay Afrouz Jabalameli
Lijie Chen Jafar Jafarov
Xue Chen Mano Vikash Janardhanan
Mahdi Cheraghchi Mani Jayaraman
Rajesh Chitnis Madhav Jha
Rezaul Chowdhury Christos Kalaitzis
Andrea Clementi Dimitris Kalimeris
Amin Coja-Oghlan Gautam Kamath
Colin Cooper Guy Kindler
Nicolas Crawford Hirotada Kobayashi
Karthik C. S. Laszlo Kozma
Aparna Das Ravishankar Krishnaswamy
Syamantak Das Janardhan Kulkarni
Ilias Diakonikolas Mrinal Kumar
Irit Dinur Ron Kupfer
Dean Doron Bundit Laekhanukit
Martin Dyer Kevin A. Lai
Charilaos Efthymiou Amit Levi
Shai Evra Ray Li
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
(APPROX/RANDOM 2018).
Editors: Eric Blais, Klaus Jansen, José D. P. Rolim, and David Steurer
Leibniz International Proceedings in Informatics
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany0:xiv Reviewers
Oren Louidor José A. Soto
Shachar Lovett Nicholas Spooner
Tianren Lu Srikanth Srinivasan
Matthew Mcpartlon Noah Stephens-Davidowitz
Moti Medina Maxim Sviridenko
Or Meir Suguru Tamaki
Julian Mestre Itzhak Tamo
Sarah Miracle Li-Yang Tan
Dieter Mitsche Avishay Tal
Michael Molloy Roei Tell
Morteza Monemizadeh Justin Thaler
Ryuhei Mori Madhur Tulsiani
Cameron Musco Gyorgy Turan
Christopher Musco Rob van Stee
Yonatan Naamad Nithin Varma
Vasileios Nakos Daniel Vaz
Ofer Neiman Sai Vikneshwar
Yakov Nekrich Emanuele Viola
Ryan O’Donnell Ellen Vitercik
Igor Carboni Oliveira Ben Lee Volk
Shayan Oveis Gharan Tal Wagner
Denis Pankratov Erik Waingarten
Yuval Peled Lutz Warnke
Pan Peng Colin White
Richard Peng Andreas Wiese
Will Perkins Ryan Williams
Orestis Plevrakis Karl Wimmer
Miklos Z. Racz Andrew Wirth
Md Lutfar Rahman Geoffrey Wolfer
Ankit Singh Rawat Jinyu Xie
Daniel Reichman Chihao Zhang
Benjamin Rossman Hongyang Zhang
Guy Rothblum Yu Zhao
Ron Rothblum Samson Zhou
Alan Roytman
Rahul Santhanam
Tamas Sarlos
Chris Schwiegelshohn
Kineret Segal
C. Seshadhri
Asaf Shapira
Alexander Sherstov
Nobutaka Shimizu
Igor Shinkar
Sahil Singla
Rene Sitters
Allan Sly
Zhao SongList of Authors
Akanksha Agrawal Prahladh Harsha
Ishay Haviv
Wing-Kai Hon
László Babai
Paul Horn
Sayan Bandyapadhyay
William M. Hoza
Amariah Becker
Zhiyi Huang
Salman Beigi
Aleksandrs Belovs
Aditya Bhaskara Fotis Iliopoulos
Timothy Black
Antonio Blanca
Jarosław Błasiok Tony Johansson
Andrej Bogdanov
Allan Borodin Valentine Kabanets
Mark Braverman Ning Kang
Vladimir Braverman Christodoulos Karavasilis
Mark Bun Tali Kaufman
Pieter Kleer
Corrie Jacobien Carstens Adam R. Klivans
Parinya Chalermsook Young Kun Ko
Chandra Chekuri Sajin Koroth
Zongchen Chen Aditya Krishnan
Kuan Cheng Janardhan Kulkarni
Eden Chlamtáč Akash Kumar
Karthik C. S. Neeraj Kumar
Srivatsan Kumar
Syamantak Das
Yotam Dikstein Bundit Laekhanukit
Irit Dinur Harry Lang
Amit Levi
Maya Leshkowitz
Talya Eden
Ray Li
Omid Etesami
Shi Li
Guy Even
Xin Li
Yi Li
Yuval Filmus Chung-Shou Liao
Tianyu Liu
Daniel Lokshtanov
Andreas Galanis
Shachar Lovett
Anat Ganor
Zhenjian Lu
Leslie Ann Goldberg
Peter Gracar
Elena Grigorescu Pasin Manurangsi
Siyao Guo Or Meir
Shalmoli Gupta Pranabendu Misra
Venkatesan Guruswami Sidhanth Mohanty
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
(APPROX/RANDOM 2018).
Editors: Eric Blais, Klaus Jansen, José D. P. Rolim, and David Steurer
Leibniz International Proceedings in Informatics
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany0:xvi Authors
Yonatan Nakar Hao-Ting Wei
Vasileios Nakos Andreas Wiese
Shyam Narayanan Karl Wimmer
David P. Woodruff
Mary Wootters
Ryan O’Donnell Xiaowei Wu
Igor C. Oliveira Angela Wuu
Izhar Oppenhein
Chaoping Xing
Denis Pankratov
Kuan Yang
Ozan Yıldız
Goonwanth Reddy Yuichi Yoshida
Dana Ron Chen Yuan
Will Rosenbaum
Meirav Zehavi
Jiapeng Zhang
Kunihiko Sadakane
Yuhao Zhang
Rahul Santhanam
Yu Zhao
Richard Santiago
Samson Zhou
Kanthi Sarpatwar
Saket Saurabh
Baruch Schieber
Rocco A. Servedio
Hadas Shachnai
F. Bruce Shepherd
Suvrit Sra
Alexandre Stauffer
Daniel Štefankovič
Madhu Sudan
Subhash Suri
Joseph Swernofsky
Li-Yang Tan
Zhihao Gavin Tang
Justin Thaler
Luca Trevisan
Kasturi Varadarajan
Shai Vardi
Daniel Vaz
Rahul Vaze
Michael Viderman
Eric Vigoda
Nisheeth K. VishnoiYou can also read
