LIPIcs, Volume 81, APPROX/RANDOM 2017

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