<h2>LIPIcs, Volume 40, APPROX/RANDOM 2015</h2>
<ul>
<li>
<span class="authors">Naveen Garg, Klaus Jansen, Anup Rao, and José D. P. Rolim</span>
<span class="title">LIPIcs, Volume 40, APPROX/RANDOM'15, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015">10.4230/LIPIcs.APPROX-RANDOM.2015</a>
</li>
<li>
<span class="authors">Naveen Garg, Klaus Jansen, Anup Rao, and José D. P. Rolim</span>
<span class="title">Frontmatter, Table of Contents, Preface, Program Commitees, External Reviewers, List of Authors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.i">10.4230/LIPIcs.APPROX-RANDOM.2015.i</a>
</li>
<li>
<span class="authors">Fidaa Abed, Parinya Chalermsook, José Correa, Andreas Karrenbauer, Pablo Pérez-Lantero, José A. Soto, and Andreas Wiese</span>
<span class="title">On Guillotine Cutting Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.1">10.4230/LIPIcs.APPROX-RANDOM.2015.1</a>
</li>
<li>
<span class="authors">Ittai Abraham, Shiri Chechik, Robert Krauthgamer, and Udi Wieder</span>
<span class="title">Approximate Nearest Neighbor Search in Metrics of Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.20">10.4230/LIPIcs.APPROX-RANDOM.2015.20</a>
</li>
<li>
<span class="authors">Anna Adamaszek, Parinya Chalermsook, and Andreas Wiese</span>
<span class="title">How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.43">10.4230/LIPIcs.APPROX-RANDOM.2015.43</a>
</li>
<li>
<span class="authors">David Adjiashvili</span>
<span class="title">Non-Uniform Robust Network Design in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.61">10.4230/LIPIcs.APPROX-RANDOM.2015.61</a>
</li>
<li>
<span class="authors">Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, and Hehui Wu</span>
<span class="title">Large Supports are Required for Well-Supported Nash Equilibria</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.78">10.4230/LIPIcs.APPROX-RANDOM.2015.78</a>
</li>
<li>
<span class="authors">Nikhil Bansal and Bouke Cloostermans</span>
<span class="title">Minimizing Maximum Flow-time on Related Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.85">10.4230/LIPIcs.APPROX-RANDOM.2015.85</a>
</li>
<li>
<span class="authors">Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, and Cliff Stein</span>
<span class="title">A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.96">10.4230/LIPIcs.APPROX-RANDOM.2015.96</a>
</li>
<li>
<span class="authors">Boaz Barak, Ankur Moitra, Ryan O’Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, and John Wright</span>
<span class="title">Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.110">10.4230/LIPIcs.APPROX-RANDOM.2015.110</a>
</li>
<li>
<span class="authors">Alok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, and Pan Xu</span>
<span class="title">Improved Bounds in Stochastic Matching and Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.124">10.4230/LIPIcs.APPROX-RANDOM.2015.124</a>
</li>
<li>
<span class="authors">Sebastian Berndt, Klaus Jansen, and Kim-Manuel Klein</span>
<span class="title">Fully Dynamic Bin Packing Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.135">10.4230/LIPIcs.APPROX-RANDOM.2015.135</a>
</li>
<li>
<span class="authors">Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, and Euiwoong Lee</span>
<span class="title">Approximate Hypergraph Coloring under Low-discrepancy and Related Promises</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.152">10.4230/LIPIcs.APPROX-RANDOM.2015.152</a>
</li>
<li>
<span class="authors">Lin Chen, Nicole Megow, Roman Rischke, and Leen Stougie</span>
<span class="title">Stochastic and Robust Scheduling in the Cloud</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.175">10.4230/LIPIcs.APPROX-RANDOM.2015.175</a>
</li>
<li>
<span class="authors">Julia Chuzhoy and David H. K. Kim</span>
<span class="title">On Approximating Node-Disjoint Paths in Grids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.187">10.4230/LIPIcs.APPROX-RANDOM.2015.187</a>
</li>
<li>
<span class="authors">Marek Cygan and Tomasz Kociumaka</span>
<span class="title">Approximating Upper Degree-Constrained Partial Orientations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.212">10.4230/LIPIcs.APPROX-RANDOM.2015.212</a>
</li>
<li>
<span class="authors">Zachary Drudi, Nicholas J. A. Harvey, Stephen Ingram, Andrew Warfield, and Jake Wires</span>
<span class="title">Approximating Hit Rate Curves using Streaming Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.225">10.4230/LIPIcs.APPROX-RANDOM.2015.225</a>
</li>
<li>
<span class="authors">Michael Elkin, Arnold Filtser, and Ofer Neiman</span>
<span class="title">Terminal Embeddings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.242">10.4230/LIPIcs.APPROX-RANDOM.2015.242</a>
</li>
<li>
<span class="authors">Zachary Friggstad and Zhihan Gao</span>
<span class="title">On Linear Programming Relaxations for Unsplittable Flow in Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.265">10.4230/LIPIcs.APPROX-RANDOM.2015.265</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami and Euiwoong Lee</span>
<span class="title">Inapproximability of H-Transversal/Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.284">10.4230/LIPIcs.APPROX-RANDOM.2015.284</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami and Euiwoong Lee</span>
<span class="title">Towards a Characterization of Approximation Resistance for Symmetric CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.305">10.4230/LIPIcs.APPROX-RANDOM.2015.305</a>
</li>
<li>
<span class="authors">David G. Harris and Francis Sullivan</span>
<span class="title">Sequential Importance Sampling Algorithms for Estimating the All-Terminal Reliability Polynomial of Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.323">10.4230/LIPIcs.APPROX-RANDOM.2015.323</a>
</li>
<li>
<span class="authors">Johan Håstad, Sangxia Huang, Rajsekar Manokaran, Ryan O’Donnell, and John Wright</span>
<span class="title">Improved NP-Inapproximability for 2-Variable Linear Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.341">10.4230/LIPIcs.APPROX-RANDOM.2015.341</a>
</li>
<li>
<span class="authors">Chien-Chung Huang, Kazuo Iwama, Shuichi Miyazaki, and Hiroki Yanagisawa</span>
<span class="title">A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.361">10.4230/LIPIcs.APPROX-RANDOM.2015.361</a>
</li>
<li>
<span class="authors">Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, and Ravi Sundaram</span>
<span class="title">Designing Overlapping Networks for Publish-Subscribe Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.381">10.4230/LIPIcs.APPROX-RANDOM.2015.381</a>
</li>
<li>
<span class="authors">Pasin Manurangsi and Dana Moshkovitz</span>
<span class="title">Approximating Dense Max 2-CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.396">10.4230/LIPIcs.APPROX-RANDOM.2015.396</a>
</li>
<li>
<span class="authors">Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, and Joel L. Wolf</span>
<span class="title">The Container Selection Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.416">10.4230/LIPIcs.APPROX-RANDOM.2015.416</a>
</li>
<li>
<span class="authors">Xiaoming Sun and David P. Woodruff</span>
<span class="title">Tight Bounds for Graph Problems in Insertion Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.435">10.4230/LIPIcs.APPROX-RANDOM.2015.435</a>
</li>
<li>
<span class="authors">Jayadev Acharya, Clément L. Canonne, and Gautam Kamath</span>
<span class="title">A Chasm Between Identity and Equivalence Testing with Conditional Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.449">10.4230/LIPIcs.APPROX-RANDOM.2015.449</a>
</li>
<li>
<span class="authors">Victor Bapst and Amin Coja-Oghlan</span>
<span class="title">Harnessing the Bethe Free Energy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.467">10.4230/LIPIcs.APPROX-RANDOM.2015.467</a>
</li>
<li>
<span class="authors">Balthazar Bauer, Shay Moran, and Amir Yehudayoff</span>
<span class="title">Internal Compression of Protocols to Entropy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.481">10.4230/LIPIcs.APPROX-RANDOM.2015.481</a>
</li>
<li>
<span class="authors">Amey Bhangale, Ramprasad Saptharishi, Girish Varma, and Rakesh Venkat</span>
<span class="title">On Fortification of Projection Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.497">10.4230/LIPIcs.APPROX-RANDOM.2015.497</a>
</li>
<li>
<span class="authors">Eric Blais, Clément L. Canonne, Igor C. Oliveira, Rocco A. Servedio, and Li-Yang Tan</span>
<span class="title">Learning Circuits with few Negations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.512">10.4230/LIPIcs.APPROX-RANDOM.2015.512</a>
</li>
<li>
<span class="authors">Antonio Blanca and Alistair Sinclair</span>
<span class="title">Dynamics for the Mean-field Random-cluster Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.528">10.4230/LIPIcs.APPROX-RANDOM.2015.528</a>
</li>
<li>
<span class="authors">Ralph Christian Bottesch, Dmitry Gavinsky, and Hartmut Klauck</span>
<span class="title">Correlation in Hard Distributions in Communication Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.544">10.4230/LIPIcs.APPROX-RANDOM.2015.544</a>
</li>
<li>
<span class="authors">Vladimir Braverman, Rafail Ostrovsky, and Alan Roytman</span>
<span class="title">Zero-One Laws for Sliding Windows and Universal Sketches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.573">10.4230/LIPIcs.APPROX-RANDOM.2015.573</a>
</li>
<li>
<span class="authors">Vladimir Braverman and Stephen R. Chestnut</span>
<span class="title">Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.591">10.4230/LIPIcs.APPROX-RANDOM.2015.591</a>
</li>
<li>
<span class="authors">Joshua Brody and Mario Sanchez</span>
<span class="title">Dependent Random Graphs and Multi-Party Pointer Jumping</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.606">10.4230/LIPIcs.APPROX-RANDOM.2015.606</a>
</li>
<li>
<span class="authors">Mark Bun and Thomas Steinke</span>
<span class="title">Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.625">10.4230/LIPIcs.APPROX-RANDOM.2015.625</a>
</li>
<li>
<span class="authors">Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, and Antonina Kolokolova</span>
<span class="title">Tighter Connections between Derandomization and Circuit Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.645">10.4230/LIPIcs.APPROX-RANDOM.2015.645</a>
</li>
<li>
<span class="authors">Shiri Chechik, Edith Cohen, and Haim Kaplan</span>
<span class="title">Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.659">10.4230/LIPIcs.APPROX-RANDOM.2015.659</a>
</li>
<li>
<span class="authors">Gil Cohen and Avishay Tal</span>
<span class="title">Two Structural Results for Low Degree Polynomials and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.680">10.4230/LIPIcs.APPROX-RANDOM.2015.680</a>
</li>
<li>
<span class="authors">Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch</span>
<span class="title">The Minimum Bisection in the Planted Bisection Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.710">10.4230/LIPIcs.APPROX-RANDOM.2015.710</a>
</li>
<li>
<span class="authors">Amin Coja-Oghlan, Charilaos Efthymiou, and Nor Jaafari</span>
<span class="title">Local Convergence of Random Graph Colorings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.726">10.4230/LIPIcs.APPROX-RANDOM.2015.726</a>
</li>
<li>
<span class="authors">Michael Dinitz, Robert Krauthgamer, and Tal Wagner</span>
<span class="title">Towards Resistance Sparsifiers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.738">10.4230/LIPIcs.APPROX-RANDOM.2015.738</a>
</li>
<li>
<span class="authors">Charilaos Efthymiou</span>
<span class="title">Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.756">10.4230/LIPIcs.APPROX-RANDOM.2015.756</a>
</li>
<li>
<span class="authors">David Felber and Rafail Ostrovsky</span>
<span class="title">A Randomized Online Quantile Summary in O(1/epsilon * log(1/epsilon)) Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.775">10.4230/LIPIcs.APPROX-RANDOM.2015.775</a>
</li>
<li>
<span class="authors">Hendrik Fichtenberger, Pan Peng, and Christian Sohler</span>
<span class="title">On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.786">10.4230/LIPIcs.APPROX-RANDOM.2015.786</a>
</li>
<li>
<span class="authors">Michael A. Forbes and Venkatesan Guruswami</span>
<span class="title">Dimension Expanders via Rank Condensers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.800">10.4230/LIPIcs.APPROX-RANDOM.2015.800</a>
</li>
<li>
<span class="authors">Andreas Galanis, Daniel Štefankovic, and Eric Vigoda</span>
<span class="title">Swendsen-Wang Algorithm on the Mean-Field Potts Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.815">10.4230/LIPIcs.APPROX-RANDOM.2015.815</a>
</li>
<li>
<span class="authors">Rong Ge and Tengyu Ma</span>
<span class="title">Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.829">10.4230/LIPIcs.APPROX-RANDOM.2015.829</a>
</li>
<li>
<span class="authors">Siyao Guo and Ilan Komargodski</span>
<span class="title">Negation-Limited Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.850">10.4230/LIPIcs.APPROX-RANDOM.2015.850</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami and Carol Wang</span>
<span class="title">Deletion Codes in the High-noise and High-rate Regimes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.867">10.4230/LIPIcs.APPROX-RANDOM.2015.867</a>
</li>
<li>
<span class="authors">Bernhard Haeupler, Pritish Kamath, and Ameya Velingker</span>
<span class="title">Communication with Partial Noiseless Feedback</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.881">10.4230/LIPIcs.APPROX-RANDOM.2015.881</a>
</li>
<li>
<span class="authors">Shiva Prasad Kasiviswanathan and Mark Rudelson</span>
<span class="title">Spectral Norm of Random Kernel Matrices with Applications to Privacy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.898">10.4230/LIPIcs.APPROX-RANDOM.2015.898</a>
</li>
<li>
<span class="authors">Robin Kothari, David Racicot-Desloges, and Miklos Santha</span>
<span class="title">Separating Decision Tree Complexity from Subcube Partition Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.915">10.4230/LIPIcs.APPROX-RANDOM.2015.915</a>
</li>
<li>
<span class="authors">Elchanan Mossel and Sebastien Roch</span>
<span class="title">Distance-based Species Tree Estimation: Information-Theoretic Trade-off between Number of Loci and Sequence Length under the Coalescent</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.931">10.4230/LIPIcs.APPROX-RANDOM.2015.931</a>
</li>
<li>
<span class="authors">Ilya Volkovich</span>
<span class="title">Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.943">10.4230/LIPIcs.APPROX-RANDOM.2015.943</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