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