LIPIcs, Volume 116, APPROX/RANDOM 2018

• Eric Blais, Klaus Jansen, José D. P. Rolim, and David Steurer LIPIcs, Volume 116, APPROX/RANDOM'18, Complete Volume 10.4230/LIPIcs.APPROX-RANDOM.2018
• Eric Blais, Klaus Jansen, José D. P. Rolim, and David Steurer Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.APPROX-RANDOM.2018.0
• Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, and Meirav Zehavi Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems 10.4230/LIPIcs.APPROX-RANDOM.2018.1
• Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, and Kasturi Varadarajan Improved Approximation Bounds for the Minimum Constraint Removal Problem 10.4230/LIPIcs.APPROX-RANDOM.2018.2
• Amariah Becker A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees 10.4230/LIPIcs.APPROX-RANDOM.2018.3
• Aditya Bhaskara and Srivatsan Kumar Low Rank Approximation in the Presence of Outliers 10.4230/LIPIcs.APPROX-RANDOM.2018.4
• Allan Borodin, Christodoulos Karavasilis, and Denis Pankratov Greedy Bipartite Matching in Random Type Poisson Arrival Model 10.4230/LIPIcs.APPROX-RANDOM.2018.5
• Mark Braverman and Young Kun Ko Semi-Direct Sum Theorem and Nearest Neighbor under l_infty 10.4230/LIPIcs.APPROX-RANDOM.2018.6
• Vladimir Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff, and Samson Zhou Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows 10.4230/LIPIcs.APPROX-RANDOM.2018.7
• Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, and Daniel Vaz Survivable Network Design for Group Connectivity in Low-Treewidth Graphs 10.4230/LIPIcs.APPROX-RANDOM.2018.8
• Chandra Chekuri and Shalmoli Gupta Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations 10.4230/LIPIcs.APPROX-RANDOM.2018.9
• Eden Chlamtác and Pasin Manurangsi Sherali-Adams Integrality Gaps Matching the Log-Density Threshold 10.4230/LIPIcs.APPROX-RANDOM.2018.10
• Talya Eden and Will Rosenbaum Lower Bounds for Approximating Graph Parameters via Communication Complexity 10.4230/LIPIcs.APPROX-RANDOM.2018.11
• Anat Ganor and Karthik C. S. Communication Complexity of Correlated Equilibrium with Small Support 10.4230/LIPIcs.APPROX-RANDOM.2018.12
• Ishay Haviv On Minrank and the Lovász Theta Function 10.4230/LIPIcs.APPROX-RANDOM.2018.13
• Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, and Yuhao Zhang Online Makespan Minimization: The Power of Restart 10.4230/LIPIcs.APPROX-RANDOM.2018.14
• Aditya Krishnan, Sidhanth Mohanty, and David P. Woodruff On Sketching the q to p Norms 10.4230/LIPIcs.APPROX-RANDOM.2018.15
• Janardhan Kulkarni and Shi Li Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models 10.4230/LIPIcs.APPROX-RANDOM.2018.16
• Amit Levi and Yuichi Yoshida Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices 10.4230/LIPIcs.APPROX-RANDOM.2018.17
• Yi Li and Vasileios Nakos Deterministic Heavy Hitters with Sublinear Query Time 10.4230/LIPIcs.APPROX-RANDOM.2018.18
• Yi Li, Vasileios Nakos, and David P. Woodruff On Low-Risk Heavy Hitters and Sparse Recovery Schemes 10.4230/LIPIcs.APPROX-RANDOM.2018.19
• Pasin Manurangsi and Luca Trevisan Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut 10.4230/LIPIcs.APPROX-RANDOM.2018.20
• Shyam Narayanan Deterministic O(1)-Approximation Algorithms to 1-Center Clustering with Outliers 10.4230/LIPIcs.APPROX-RANDOM.2018.21
• Goonwanth Reddy and Rahul Vaze Robust Online Speed Scaling With Deadline Uncertainty 10.4230/LIPIcs.APPROX-RANDOM.2018.22
• Richard Santiago and F. Bruce Shepherd Multi-Agent Submodular Optimization 10.4230/LIPIcs.APPROX-RANDOM.2018.23
• Kanthi Sarpatwar, Baruch Schieber, and Hadas Shachnai Generalized Assignment of Time-Sensitive Item Groups 10.4230/LIPIcs.APPROX-RANDOM.2018.24
• Suvrit Sra, Nisheeth K. Vishnoi, and Ozan Yildiz On Geodesically Convex Formulations for the Brascamp-Lieb Constant 10.4230/LIPIcs.APPROX-RANDOM.2018.25
• Joseph Swernofsky Tensor Rank is Hard to Approximate 10.4230/LIPIcs.APPROX-RANDOM.2018.26
• Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, and Kunihiko Sadakane An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity 10.4230/LIPIcs.APPROX-RANDOM.2018.27
• Andreas Wiese Fixed-Parameter Approximation Schemes for Weighted Flowtime 10.4230/LIPIcs.APPROX-RANDOM.2018.28
• László Babai, Timothy J. F. Black, and Angela Wuu List-Decoding Homomorphism Codes with Arbitrary Codomains 10.4230/LIPIcs.APPROX-RANDOM.2018.29
• Salman Beigi, Andrej Bogdanov, Omid Etesami, and Siyao Guo Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources 10.4230/LIPIcs.APPROX-RANDOM.2018.30
• Aleksandrs Belovs Adaptive Lower Bound for Testing Monotonicity on the Line 10.4230/LIPIcs.APPROX-RANDOM.2018.31
• Antonio Blanca, Zongchen Chen, and Eric Vigoda Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region 10.4230/LIPIcs.APPROX-RANDOM.2018.32
• Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, and Kuan Yang Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs 10.4230/LIPIcs.APPROX-RANDOM.2018.33
• Jaroslaw Blasiok, Venkatesan Guruswami, and Madhu Sudan Polar Codes with Exponentially Small Error at Finite Block Length 10.4230/LIPIcs.APPROX-RANDOM.2018.34
• Mark Bun and Justin Thaler Approximate Degree and the Complexity of Depth Three Circuits 10.4230/LIPIcs.APPROX-RANDOM.2018.35
• Corrie Jacobien Carstens and Pieter Kleer Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence 10.4230/LIPIcs.APPROX-RANDOM.2018.36
• Kuan Cheng and Xin Li Randomness Extraction in AC0 and with Small Locality 10.4230/LIPIcs.APPROX-RANDOM.2018.37
• Yotam Dikstein, Irit Dinur, Yuval Filmus, and Prahladh Harsha Boolean Function Analysis on High-Dimensional Expanders 10.4230/LIPIcs.APPROX-RANDOM.2018.38
• Peter Gracar and Alexandre Stauffer Percolation of Lipschitz Surface and Tight Bounds on the Spread of Information Among Mobile Agents 10.4230/LIPIcs.APPROX-RANDOM.2018.39
• Elena Grigorescu, Akash Kumar, and Karl Wimmer Flipping out with Many Flips: Hardness of Testing k-Monotonicity 10.4230/LIPIcs.APPROX-RANDOM.2018.40
• Venkatesan Guruswami, Chaoping Xing, and Chen Yuan How Long Can Optimal Locally Repairable Codes Be? 10.4230/LIPIcs.APPROX-RANDOM.2018.41
• Ishay Haviv On Minrank and Forbidden Subgraphs 10.4230/LIPIcs.APPROX-RANDOM.2018.42
• William M. Hoza and Adam R. Klivans Preserving Randomness for Adaptive Algorithms 10.4230/LIPIcs.APPROX-RANDOM.2018.43
• Fotis Iliopoulos Commutative Algorithms Approximate the LLL-distribution 10.4230/LIPIcs.APPROX-RANDOM.2018.44
• Tony Johansson The Cover Time of a Biased Random Walk on a Random Regular Graph of Odd Degree 10.4230/LIPIcs.APPROX-RANDOM.2018.45
• Valentine Kabanets and Zhenjian Lu Satisfiability and Derandomization for Small Polynomial Threshold Circuits 10.4230/LIPIcs.APPROX-RANDOM.2018.46
• Tali Kaufman and Izhar Oppenheim High Order Random Walks: Beyond Spectral Gap 10.4230/LIPIcs.APPROX-RANDOM.2018.47
• Sajin Koroth and Or Meir Improved Composition Theorems for Functions and Relations 10.4230/LIPIcs.APPROX-RANDOM.2018.48
• Maya Leshkowitz Round Complexity Versus Randomness Complexity in Interactive Proofs 10.4230/LIPIcs.APPROX-RANDOM.2018.49
• Ray Li and Mary Wootters Improved List-Decodability of Random Linear Binary Codes 10.4230/LIPIcs.APPROX-RANDOM.2018.50
• Xin Li, Shachar Lovett, and Jiapeng Zhang Sunflowers and Quasi-Sunflowers from Randomness Extractors 10.4230/LIPIcs.APPROX-RANDOM.2018.51
• Tianyu Liu Torpid Mixing of Markov Chains for the Six-vertex Model on Z^2 10.4230/LIPIcs.APPROX-RANDOM.2018.52
• Yonatan Nakar and Dana Ron On the Testability of Graph Partition Properties 10.4230/LIPIcs.APPROX-RANDOM.2018.53
• Ryan O'Donnell and Yu Zhao On Closeness to k-Wise Uniformity 10.4230/LIPIcs.APPROX-RANDOM.2018.54
• Igor Carboni Oliveira and Rahul Santhanam Pseudo-Derandomizing Learning and Approximation 10.4230/LIPIcs.APPROX-RANDOM.2018.55
• Rocco A. Servedio and Li-Yang Tan Luby-Velickovic-Wigderson Revisited: Improved Correlation Bounds and Pseudorandom Generators for Depth-Two Circuits 10.4230/LIPIcs.APPROX-RANDOM.2018.56
• Shai Vardi Randomly Coloring Graphs of Logarithmically Bounded Pathwidth 10.4230/LIPIcs.APPROX-RANDOM.2018.57
• Michael Viderman Explicit Strong LTCs with Inverse Poly-Log Rate and Constant Soundness 10.4230/LIPIcs.APPROX-RANDOM.2018.58