LIPIcs, Volume 60, APPROX/RANDOM 2016

Klaus Jansen, Claire Mathieu, José D. P. Rolim, and Chris Umans LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume 10.4230/LIPIcs.APPROX-RANDOM.2016
Klaus Jansen, Claire Mathieu, José D. P. Rolim, and Chris Umans Front Matter, Table of Contents, Preface, Program Committees, External Reviewers, List of Authors 10.4230/LIPIcs.APPROX-RANDOM.2016.0
Arturs Backurs and Anastasios Sidiropoulos Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l_p Spaces 10.4230/LIPIcs.APPROX-RANDOM.2016.1
Amitabh Basu, Michael Dinitz, and Xin Li Computing Approximate PSD Factorizations 10.4230/LIPIcs.APPROX-RANDOM.2016.2
Ivan Bliznets, Marek Cygan, Pawel Komosa, and Michal Pilipczuk Hardness of Approximation for H-Free Edge Modification Problems 10.4230/LIPIcs.APPROX-RANDOM.2016.3
Moses Charikar, Yonatan Naamad, and Anthony Wirth On Approximating Target Set Selection 10.4230/LIPIcs.APPROX-RANDOM.2016.4
Lin Chen, Deshi Ye, and Guochuan Zhang Approximation Algorithms for Parallel Machine Scheduling with Speed-up Resources 10.4230/LIPIcs.APPROX-RANDOM.2016.5
Eden Chlamtac, Michael Dinitz, Christian Konrad, Guy Kortsarz, and George Rabanca The Densest k-Subhypergraph Problem 10.4230/LIPIcs.APPROX-RANDOM.2016.6
Michael B. Cohen, Cameron Musco, and Jakub Pachocki Online Row Sampling 10.4230/LIPIcs.APPROX-RANDOM.2016.7
Uriel Feige, Michal Feldman, and Inbal Talgam-Cohen Oblivious Rounding and the Integrality Gap 10.4230/LIPIcs.APPROX-RANDOM.2016.8
Nir Halman A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy 10.4230/LIPIcs.APPROX-RANDOM.2016.9
Sungjin Im, Janardhan Kulkarni, Benjamin Moseley, and Kamesh Munagala A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints 10.4230/LIPIcs.APPROX-RANDOM.2016.10
Samir Khuller and Sheng Yang Revisiting Connected Dominating Sets: An Optimal Local Algorithm? 10.4230/LIPIcs.APPROX-RANDOM.2016.11
Anthony Kim, Vahid Liaghat, Junjie Qin, and Amin Saberi Online Energy Storage Management: an Algorithmic Approach 10.4230/LIPIcs.APPROX-RANDOM.2016.12
Guy Kortsarz and Zeev Nutov LP-Relaxations for Tree Augmentation 10.4230/LIPIcs.APPROX-RANDOM.2016.13
Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, and Justin Ward A Bi-Criteria Approximation Algorithm for k-Means 10.4230/LIPIcs.APPROX-RANDOM.2016.14
Pasin Manurangsi, Preetum Nakkiran, and Luca Trevisan Near-Optimal UGC-hardness of Approximating Max k-CSP_R 10.4230/LIPIcs.APPROX-RANDOM.2016.15
Dániel Marx, Ario Salmasi, and Anastasios Sidiropoulos Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs 10.4230/LIPIcs.APPROX-RANDOM.2016.16
Andrew McGregor and Sofya Vorotnikova Planar Matching in Streams Revisited 10.4230/LIPIcs.APPROX-RANDOM.2016.17
Sharath Raghvendra A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching 10.4230/LIPIcs.APPROX-RANDOM.2016.18
Noah Stephens-Davidowitz Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One 10.4230/LIPIcs.APPROX-RANDOM.2016.19
Ridwan Syed and Madhur Tulsiani Proving Weak Approximability Without Algorithms 10.4230/LIPIcs.APPROX-RANDOM.2016.20
Jasine Babu, Areej Khoury, and Ilan Newman Every Property of Outerplanar Graphs is Testable 10.4230/LIPIcs.APPROX-RANDOM.2016.21
Victor Bapst and Amin Coja-Oghlan The Condensation Phase Transition in the Regular k-SAT Model 10.4230/LIPIcs.APPROX-RANDOM.2016.22
Arnab Bhattacharyya, Abhishek Bhowmick, and Chetan Gupta On Higher-Order Fourier Analysis over Non-Prime Fields 10.4230/LIPIcs.APPROX-RANDOM.2016.23
Ravi Boppana, Johan Håstad, Chin Ho Lee, and Emanuele Viola Bounded Independence vs. Moduli 10.4230/LIPIcs.APPROX-RANDOM.2016.24
Vladimir Braverman, Alan Roytman, and Gregory Vorsanger Approximating Subadditive Hadamard Functions on Implicit Matrices 10.4230/LIPIcs.APPROX-RANDOM.2016.25
Guillaume Chapuy and Guillem Perarnau Local Convergence and Stability of Tight Bridge-Addable Graph Classes 10.4230/LIPIcs.APPROX-RANDOM.2016.26
Amin Coja-Oghlan and Will Perkins Belief Propagation on Replica Symmetric Random Factor Graph Models 10.4230/LIPIcs.APPROX-RANDOM.2016.27
Daniel Dadush, Shashwat Garg, Shachar Lovett, and Aleksandar Nikolov Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem 10.4230/LIPIcs.APPROX-RANDOM.2016.28
Esther Ezra and Shachar Lovett On the Beck-Fiala Conjecture for Random Set Systems 10.4230/LIPIcs.APPROX-RANDOM.2016.29
Bernd Gärtner and Antonis Thomas The Niceness of Unique Sink Orientations 10.4230/LIPIcs.APPROX-RANDOM.2016.30
Heng Guo and Pinyan Lu Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems 10.4230/LIPIcs.APPROX-RANDOM.2016.31
Prahladh Harsha and Srikanth Srinivasan On Polynomial Approximations to AC^0 10.4230/LIPIcs.APPROX-RANDOM.2016.32
Pooya Hatami On the Structure of Quintic Polynomials 10.4230/LIPIcs.APPROX-RANDOM.2016.33
Jan Hazla, Thomas Holenstein, and Elchanan Mossel Lower Bounds on Same-Set Inner Product in Correlated Spaces 10.4230/LIPIcs.APPROX-RANDOM.2016.34
Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, and Henrique Stagni Estimating Parameters Associated with Monotone Properties 10.4230/LIPIcs.APPROX-RANDOM.2016.35
Varun Kanade, Nikos Leonardos, and Frédéric Magniez Stable Matching with Evolving Preferences 10.4230/LIPIcs.APPROX-RANDOM.2016.36
Subhash Khot and Igor Shinkar An ~O(n) Queries Adaptive Tester for Unateness 10.4230/LIPIcs.APPROX-RANDOM.2016.37
Reut Levi, Dana Ron, and Ronitt Rubinfeld A Local Algorithm for Constructing Spanners in Minor-Free Graphs 10.4230/LIPIcs.APPROX-RANDOM.2016.38
Yi Li and David P. Woodruff Tight Bounds for Sketching the Operator Norm, Schatten Norms, and Subspace Embeddings 10.4230/LIPIcs.APPROX-RANDOM.2016.39
Dhruv Medarametla and Aaron Potechin Bounds on the Norms of Uniform Low Degree Graph Matrices 10.4230/LIPIcs.APPROX-RANDOM.2016.40
Ryuhei Mori and David Witmer Lower Bounds for CSP Refutation by SDP Hierarchies 10.4230/LIPIcs.APPROX-RANDOM.2016.41
Dana Moshkovitz, Govind Ramnarayan, and Henry Yuen A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian 10.4230/LIPIcs.APPROX-RANDOM.2016.42
Cyril Nicaud Fast Synchronization of Random Automata 10.4230/LIPIcs.APPROX-RANDOM.2016.43
Anup Rao and Makrand Sinha A Direct-Sum Theorem for Read-Once Branching Programs 10.4230/LIPIcs.APPROX-RANDOM.2016.44
Ronen Shaltiel and Jad Silbak Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels 10.4230/LIPIcs.APPROX-RANDOM.2016.45
Renjie Song, Yitong Yin, and Jinman Zhao Counting Hypergraph Matchings up to Uniqueness Threshold 10.4230/LIPIcs.APPROX-RANDOM.2016.46
Yitong Yin and Chihao Zhang Sampling in Potts Model on Sparse Random Graphs 10.4230/LIPIcs.APPROX-RANDOM.2016.47