<h2>LIPIcs, Volume 81, APPROX/RANDOM 2017</h2>
<ul>
<li>
<span class="authors">Klaus Jansen, José D. P. Rolim, David Williamson, and Santosh S. Vempala</span>
<span class="title">LIPIcs, Volume 81, APPROX/RANDOM'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017">10.4230/LIPIcs.APPROX-RANDOM.2017</a>
</li>
<li>
<span class="authors">Klaus Jansen, José D. P. Rolim, David P. Williamson, and Santosh S. Vempala</span>
<span class="title">Frontmatter, Table of Contents, Preface, Organization, External Reviewers, List of Authors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.0">10.4230/LIPIcs.APPROX-RANDOM.2017.0</a>
</li>
<li>
<span class="authors">Itai Ashlagi, Yossi Azar, Moses Charikar, Ashish Chiplunkar, Ofir Geri, Haim Kaplan, Rahul Makhijani, Yuyi Wang, and Roger Wattenhofer</span>
<span class="title">Min-Cost Bipartite Perfect Matching with Delays</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.1">10.4230/LIPIcs.APPROX-RANDOM.2017.1</a>
</li>
<li>
<span class="authors">Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, and Chao Xu</span>
<span class="title">Global and Fixed-Terminal Cuts in Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.2">10.4230/LIPIcs.APPROX-RANDOM.2017.2</a>
</li>
<li>
<span class="authors">Glencora Borradaile and Baigong Zheng</span>
<span class="title">A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.3">10.4230/LIPIcs.APPROX-RANDOM.2017.3</a>
</li>
<li>
<span class="authors">Joshua Brakensiek and Venkatesan Guruswami</span>
<span class="title">The Quest for Strong Inapproximability Results with Perfect Completeness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.4">10.4230/LIPIcs.APPROX-RANDOM.2017.4</a>
</li>
<li>
<span class="authors">Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, and Yifeng Zhang</span>
<span class="title">Scheduling Problems over Network of Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.5">10.4230/LIPIcs.APPROX-RANDOM.2017.5</a>
</li>
<li>
<span class="authors">Michel X. Goemans and Francisco Unda</span>
<span class="title">Approximating Incremental Combinatorial Optimization Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.6">10.4230/LIPIcs.APPROX-RANDOM.2017.6</a>
</li>
<li>
<span class="authors">Anupam Gupta and Archit Karandikar</span>
<span class="title">Stochastic Unsplittable Flows</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.7">10.4230/LIPIcs.APPROX-RANDOM.2017.7</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami, Ameya Velingker, and Santhoshini Velusamy</span>
<span class="title">Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.8">10.4230/LIPIcs.APPROX-RANDOM.2017.8</a>
</li>
<li>
<span class="authors">Samuel Haney, Bruce Maggs, Biswaroop Maiti, Debmalya Panigrahi, Rajmohan Rajaraman, and Ravi Sundaram</span>
<span class="title">Symmetric Interdiction for Matching Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.9">10.4230/LIPIcs.APPROX-RANDOM.2017.9</a>
</li>
<li>
<span class="authors">David G. Harris, Thomas Pensyl, Aravind Srinivasan, and Khoa Trinh</span>
<span class="title">A Lottery Model for Center-Type Problems with Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.10">10.4230/LIPIcs.APPROX-RANDOM.2017.10</a>
</li>
<li>
<span class="authors">Chien-Chung Huang, Naonori Kakimura, and Yuichi Yoshida</span>
<span class="title">Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.11">10.4230/LIPIcs.APPROX-RANDOM.2017.11</a>
</li>
<li>
<span class="authors">Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan Ullman, Ali Vakilian, and Anak Yodpinyanee</span>
<span class="title">Fractional Set Cover in the Streaming Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.12">10.4230/LIPIcs.APPROX-RANDOM.2017.12</a>
</li>
<li>
<span class="authors">Klaus Jansen, Kim-Manuel Klein, Maria Kosche, and Leon Ladewig</span>
<span class="title">Online Strip Packing with Polynomial Migration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.13">10.4230/LIPIcs.APPROX-RANDOM.2017.13</a>
</li>
<li>
<span class="authors">Gorav Jindal, Pavel Kolev, Richard Peng, and Saurabh Sawlani</span>
<span class="title">Density Independent Algorithms for Sparsifying k-Step Random Walks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.14">10.4230/LIPIcs.APPROX-RANDOM.2017.14</a>
</li>
<li>
<span class="authors">Sagar Kale and Sumedh Tirodkar</span>
<span class="title">Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.15">10.4230/LIPIcs.APPROX-RANDOM.2017.15</a>
</li>
<li>
<span class="authors">Thomas Kesselheim and Andreas Tönnis</span>
<span class="title">Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.16">10.4230/LIPIcs.APPROX-RANDOM.2017.16</a>
</li>
<li>
<span class="authors">Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, and Jens Vygen</span>
<span class="title">On the Integrality Gap of the Prize-Collecting Steiner Forest LP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.17">10.4230/LIPIcs.APPROX-RANDOM.2017.17</a>
</li>
<li>
<span class="authors">Vedat Levi Alev and Lap Chi Lau</span>
<span class="title">Approximating Unique Games Using Low Diameter Graph Decomposition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.18">10.4230/LIPIcs.APPROX-RANDOM.2017.18</a>
</li>
<li>
<span class="authors">Edo Liberty and Maxim Sviridenko</span>
<span class="title">Greedy Minimization of Weakly Supermodular Set Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.19">10.4230/LIPIcs.APPROX-RANDOM.2017.19</a>
</li>
<li>
<span class="authors">Maciej Obremski and Maciej Skorski</span>
<span class="title">Renyi Entropy Estimation Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20">10.4230/LIPIcs.APPROX-RANDOM.2017.20</a>
</li>
<li>
<span class="authors">Yuval Rabani and Rakesh Venkat</span>
<span class="title">Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.21">10.4230/LIPIcs.APPROX-RANDOM.2017.21</a>
</li>
<li>
<span class="authors">Tim Roughgarden, Inbal Talgam-Cohen, and Jan Vondrák</span>
<span class="title">When Are Welfare Guarantees Robust?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.22">10.4230/LIPIcs.APPROX-RANDOM.2017.22</a>
</li>
<li>
<span class="authors">Rupam Acharyya and Daniel Stefankovic</span>
<span class="title">Glauber Dynamics for Ising Model on Convergent Dense Graph Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.23">10.4230/LIPIcs.APPROX-RANDOM.2017.23</a>
</li>
<li>
<span class="authors">Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla, and Vivek Madan</span>
<span class="title">On the Expansion of Group-Based Lifts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.24">10.4230/LIPIcs.APPROX-RANDOM.2017.24</a>
</li>
<li>
<span class="authors">Noga Alon and Omri Ben-Eliezer</span>
<span class="title">Efficient Removal Lemmas for Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.25">10.4230/LIPIcs.APPROX-RANDOM.2017.25</a>
</li>
<li>
<span class="authors">Omer Angel, Abbas Mehrabian, and Yuval Peres</span>
<span class="title">The String of Diamonds Is Tight for Rumor Spreading</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.26">10.4230/LIPIcs.APPROX-RANDOM.2017.26</a>
</li>
<li>
<span class="authors">Haim Avron, Kenneth L. Clarkson, and David P. Woodruff</span>
<span class="title">Sharper Bounds for Regularized Data Fitting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.27">10.4230/LIPIcs.APPROX-RANDOM.2017.27</a>
</li>
<li>
<span class="authors">Jess Banks, Robert Kleinberg, and Cristopher Moore</span>
<span class="title">The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.28">10.4230/LIPIcs.APPROX-RANDOM.2017.28</a>
</li>
<li>
<span class="authors">Anna Ben-Hamou and Yuval Peres</span>
<span class="title">Cutoff for a Stratified Random Walk on the Hypercube</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.29">10.4230/LIPIcs.APPROX-RANDOM.2017.29</a>
</li>
<li>
<span class="authors">Arnab Bhattacharyya, Sivakanth Gopi, and Avishay Tal</span>
<span class="title">Lower Bounds for 2-Query LCCs over Large Alphabet</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.30">10.4230/LIPIcs.APPROX-RANDOM.2017.30</a>
</li>
<li>
<span class="authors">Vijay Bhattiprolu, Venkatesan Guruswami, and Euiwoong Lee</span>
<span class="title">Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.31">10.4230/LIPIcs.APPROX-RANDOM.2017.31</a>
</li>
<li>
<span class="authors">Jaroslaw Blasiok, Jian Ding, and Jelani Nelson</span>
<span class="title">Continuous Monitoring of l_p Norms in Data Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.32">10.4230/LIPIcs.APPROX-RANDOM.2017.32</a>
</li>
<li>
<span class="authors">Joshua Brakensiek</span>
<span class="title">Vertex Isoperimetry and Independent Set Stability for Tensor Powers of Cliques</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.33">10.4230/LIPIcs.APPROX-RANDOM.2017.33</a>
</li>
<li>
<span class="authors">Sarah Cannon, David A. Levin, and Alexandre Stauffer</span>
<span class="title">Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.34">10.4230/LIPIcs.APPROX-RANDOM.2017.34</a>
</li>
<li>
<span class="authors">Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, and Antonina Kolokolova</span>
<span class="title">Agnostic Learning from Tolerant Natural Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.35">10.4230/LIPIcs.APPROX-RANDOM.2017.35</a>
</li>
<li>
<span class="authors">L. Elisa Celis, Amit Deshpande, Tarun Kathuria, Damian Straszak, and Nisheeth K. Vishnoi</span>
<span class="title">On the Complexity of Constrained Determinantal Point Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.36">10.4230/LIPIcs.APPROX-RANDOM.2017.36</a>
</li>
<li>
<span class="authors">Xi Chen, Adam Freilich, Rocco A. Servedio, and Timothy Sun</span>
<span class="title">Sample-Based High-Dimensional Convexity Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.37">10.4230/LIPIcs.APPROX-RANDOM.2017.37</a>
</li>
<li>
<span class="authors">Xi Chen, Rocco A. Servedio, Li-Yang Tan, and Erik Waingarten</span>
<span class="title">Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.38">10.4230/LIPIcs.APPROX-RANDOM.2017.38</a>
</li>
<li>
<span class="authors">Alessandro Chiesa, Peter Manohar, and Igor Shinkar</span>
<span class="title">On Axis-Parallel Tests for Tensor Product Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.39">10.4230/LIPIcs.APPROX-RANDOM.2017.39</a>
</li>
<li>
<span class="authors">Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, Mihyun Kang, and Tobias Kapetanopoulos</span>
<span class="title">Charting the Replica Symmetric Phase</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.40">10.4230/LIPIcs.APPROX-RANDOM.2017.40</a>
</li>
<li>
<span class="authors">Dean Doron, François Le Gall, and Amnon Ta-Shma</span>
<span class="title">Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.41">10.4230/LIPIcs.APPROX-RANDOM.2017.41</a>
</li>
<li>
<span class="authors">Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, and Samson Zhou</span>
<span class="title">Streaming Periodicity with Mismatches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.42">10.4230/LIPIcs.APPROX-RANDOM.2017.42</a>
</li>
<li>
<span class="authors">S. Luna Frank-Fischer, Venkatesan Guruswami, and Mary Wootters</span>
<span class="title">Locality via Partially Lifted Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.43">10.4230/LIPIcs.APPROX-RANDOM.2017.43</a>
</li>
<li>
<span class="authors">Cody R. Freitag, Eric Price, and William J. Swartworth</span>
<span class="title">Testing Hereditary Properties of Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.44">10.4230/LIPIcs.APPROX-RANDOM.2017.44</a>
</li>
<li>
<span class="authors">Alan Frieze and Wesley Pegden</span>
<span class="title">Traveling in Randomly Embedded Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.45">10.4230/LIPIcs.APPROX-RANDOM.2017.45</a>
</li>
<li>
<span class="authors">Alexander Golovnev, Oded Regev, and Omri Weinstein</span>
<span class="title">The Minrank of Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.46">10.4230/LIPIcs.APPROX-RANDOM.2017.46</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami and Ray Li</span>
<span class="title">Efficiently Decodable Codes for the Binary Deletion Channel</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.47">10.4230/LIPIcs.APPROX-RANDOM.2017.47</a>
</li>
<li>
<span class="authors">Ilya Volkovich</span>
<span class="title">On Some Computations on Sparse Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.48">10.4230/LIPIcs.APPROX-RANDOM.2017.48</a>
</li>
<li>
<span class="authors">Thomas Watson</span>
<span class="title">Communication Complexity of Statistical Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.49">10.4230/LIPIcs.APPROX-RANDOM.2017.49</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