<h2>LIPIcs, Volume 28, APPROX/RANDOM 2014</h2>
<ul>
<li>
<span class="authors">Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, and Cristopher Moore</span>
<span class="title">LIPIcs, Volume 28, APPROX/RANDOM'14, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014">10.4230/LIPIcs.APPROX-RANDOM.2014</a>
</li>
<li>
<span class="authors">Klaus Jansen, José Rolim, Nikhil R. Devanur, and Cristopher Moore</span>
<span class="title">Frontmatter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.i">10.4230/LIPIcs.APPROX-RANDOM.2014.i</a>
</li>
<li>
<span class="authors">Ittai Abraham, Shiri Chechik, and Kunal Talwar</span>
<span class="title">Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.1">10.4230/LIPIcs.APPROX-RANDOM.2014.1</a>
</li>
<li>
<span class="authors">Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, and Chaitanya Swamy</span>
<span class="title">Approximation Algorithms for Minimum-Load k-Facility Location</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.17">10.4230/LIPIcs.APPROX-RANDOM.2014.17</a>
</li>
<li>
<span class="authors">Noga Alon, Troy Lee, and Adi Shraibman</span>
<span class="title">The Cover Number of a Matrix and its Algorithmic Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.34">10.4230/LIPIcs.APPROX-RANDOM.2014.34</a>
</li>
<li>
<span class="authors">Siddharth Barman, Shuchi Chawla, and Seeun Umboh</span>
<span class="title">Network Design with Coverage Costs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.48">10.4230/LIPIcs.APPROX-RANDOM.2014.48</a>
</li>
<li>
<span class="authors">Kshipra Bhawalkar, Sreenivas Gollapudi, and Debmalya Panigrahi</span>
<span class="title">Online Set Cover with Set Requests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.64">10.4230/LIPIcs.APPROX-RANDOM.2014.64</a>
</li>
<li>
<span class="authors">Eden Chlamtác and Michael Dinitz</span>
<span class="title">Lowest Degree k-Spanner: Approximation and Hardness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.80">10.4230/LIPIcs.APPROX-RANDOM.2014.80</a>
</li>
<li>
<span class="authors">Michael Crouch and Daniel M. Stubbs</span>
<span class="title">Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.96">10.4230/LIPIcs.APPROX-RANDOM.2014.96</a>
</li>
<li>
<span class="authors">Amit Deshpande and Rakesh Venkat</span>
<span class="title">Guruswami-Sinop Rounding without Higher Level Lasserre</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.105">10.4230/LIPIcs.APPROX-RANDOM.2014.105</a>
</li>
<li>
<span class="authors">Michael Dinitz, Guy Kortsarz, and Zeev Nutov</span>
<span class="title">Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.115">10.4230/LIPIcs.APPROX-RANDOM.2014.115</a>
</li>
<li>
<span class="authors">Adrian Dumitrescu, Minghui Jiang, and Csaba D. Tóth</span>
<span class="title">Computing Opaque Interior Barriers à la Shermer</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.128">10.4230/LIPIcs.APPROX-RANDOM.2014.128</a>
</li>
<li>
<span class="authors">Alina Ene and Jan Vondrák</span>
<span class="title">Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.144">10.4230/LIPIcs.APPROX-RANDOM.2014.144</a>
</li>
<li>
<span class="authors">Moran Feldman and Rani Izsak</span>
<span class="title">Constrained Monotone Function Maximization and the Supermodular Degree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.160">10.4230/LIPIcs.APPROX-RANDOM.2014.160</a>
</li>
<li>
<span class="authors">Andreas Emil Feldmann, Jochen Könemann, Neil Olver, and Laura Sanità</span>
<span class="title">On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.176">10.4230/LIPIcs.APPROX-RANDOM.2014.176</a>
</li>
<li>
<span class="authors">Michal Feldman, Nicole Immorlica, Brendan Lucier, and S. Matthew Weinberg</span>
<span class="title">Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.192">10.4230/LIPIcs.APPROX-RANDOM.2014.192</a>
</li>
<li>
<span class="authors">Takuro Fukunaga, Afshin Nikzad, and R. Ravi</span>
<span class="title">Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.209">10.4230/LIPIcs.APPROX-RANDOM.2014.209</a>
</li>
<li>
<span class="authors">Martin Gairing, Tobias Harks, and Max Klimm</span>
<span class="title">Complexity and Approximation of the Continuous Network Design Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.226">10.4230/LIPIcs.APPROX-RANDOM.2014.226</a>
</li>
<li>
<span class="authors">Christoph Hansknecht, Max Klimm, and Alexander Skopalik</span>
<span class="title">Approximate Pure Nash Equilibria in Weighted Congestion Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242">10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>
</li>
<li>
<span class="authors">Nicholas J. A. Harvey, Roy Schwartz, and Mohit Singh</span>
<span class="title">Discrepancy Without Partial Colorings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.258">10.4230/LIPIcs.APPROX-RANDOM.2014.258</a>
</li>
<li>
<span class="authors">Shlomo Jozeph</span>
<span class="title">Universal Factor Graphs for Every NP-Hard Boolean CSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.274">10.4230/LIPIcs.APPROX-RANDOM.2014.274</a>
</li>
<li>
<span class="authors">Jeremy A. Karp and R. Ravi</span>
<span class="title">A 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.284">10.4230/LIPIcs.APPROX-RANDOM.2014.284</a>
</li>
<li>
<span class="authors">Stavros G. Kolliopoulos and Yannis Moysoglou</span>
<span class="title">Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility Location</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.297">10.4230/LIPIcs.APPROX-RANDOM.2014.297</a>
</li>
<li>
<span class="authors">Tsz Chiu Kwok and Lap Chi Lau</span>
<span class="title">Lower Bounds on Expansions of Graph Powers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.313">10.4230/LIPIcs.APPROX-RANDOM.2014.313</a>
</li>
<li>
<span class="authors">Shanfei Li</span>
<span class="title">An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.325">10.4230/LIPIcs.APPROX-RANDOM.2014.325</a>
</li>
<li>
<span class="authors">Anand Louis and Yury Makarychev</span>
<span class="title">Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.339">10.4230/LIPIcs.APPROX-RANDOM.2014.339</a>
</li>
<li>
<span class="authors">Shashi Mittal, Andreas S. Schulz, and Sebastian Stiller</span>
<span class="title">Robust Appointment Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.356">10.4230/LIPIcs.APPROX-RANDOM.2014.356</a>
</li>
<li>
<span class="authors">Abhiram Natarajan and Yi Wu</span>
<span class="title">Computational Complexity of Certifying Restricted Isometry Property</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.371">10.4230/LIPIcs.APPROX-RANDOM.2014.371</a>
</li>
<li>
<span class="authors">Prasad Raghavendra and Tselil Schramm</span>
<span class="title">Gap Amplification for Small-Set Expansion via Random Walks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.381">10.4230/LIPIcs.APPROX-RANDOM.2014.381</a>
</li>
<li>
<span class="authors">Alan J. Soper and Vitaly A. Strusevich</span>
<span class="title">Power of Preemption on Uniform Parallel Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.392">10.4230/LIPIcs.APPROX-RANDOM.2014.392</a>
</li>
<li>
<span class="authors">Chaitanya Swamy</span>
<span class="title">Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.403">10.4230/LIPIcs.APPROX-RANDOM.2014.403</a>
</li>
<li>
<span class="authors">Suguru Tamaki and Yuichi Yoshida</span>
<span class="title">Robust Approximation of Temporal CSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.419">10.4230/LIPIcs.APPROX-RANDOM.2014.419</a>
</li>
<li>
<span class="authors">Cenny Wenner</span>
<span class="title">Parity is Positively Useless</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.433">10.4230/LIPIcs.APPROX-RANDOM.2014.433</a>
</li>
<li>
<span class="authors">Victor Bapst, Amin Coja-Oghlan, Samuel Hetterich, Felicia Raßmann, and Dan Vilenchik</span>
<span class="title">The Condensation Phase Transition in Random Graph Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.449">10.4230/LIPIcs.APPROX-RANDOM.2014.449</a>
</li>
<li>
<span class="authors">Eric Blais, Joshua Brody, and Badih Ghazi</span>
<span class="title">The Information Complexity of Hamming Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.465">10.4230/LIPIcs.APPROX-RANDOM.2014.465</a>
</li>
<li>
<span class="authors">Julia Böttcher, Jan Hladký, Diana Piguet, and Anusch Taraz</span>
<span class="title">An Approximate Version of the Tree Packing Conjecture via Random Embeddings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.490">10.4230/LIPIcs.APPROX-RANDOM.2014.490</a>
</li>
<li>
<span class="authors">Milan Bradonjic and Will Perkins</span>
<span class="title">On Sharp Thresholds in Random Geometric Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.500">10.4230/LIPIcs.APPROX-RANDOM.2014.500</a>
</li>
<li>
<span class="authors">Gábor Braun, Samuel Fiorini, and Sebastian Pokutta</span>
<span class="title">Average Case Polyhedral Complexity of the Maximum Stable Set Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.515">10.4230/LIPIcs.APPROX-RANDOM.2014.515</a>
</li>
<li>
<span class="authors">Vladimir Braverman, Jonathan Katzman, Charles Seidell, and Gregory Vorsanger</span>
<span class="title">An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.531">10.4230/LIPIcs.APPROX-RANDOM.2014.531</a>
</li>
<li>
<span class="authors">Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, and Grigory Yaroslavtsev</span>
<span class="title">Certifying Equality With Limited Interaction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.545">10.4230/LIPIcs.APPROX-RANDOM.2014.545</a>
</li>
<li>
<span class="authors">Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, and Eric Vigoda</span>
<span class="title">#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.582">10.4230/LIPIcs.APPROX-RANDOM.2014.582</a>
</li>
<li>
<span class="authors">Arkadev Chattopadhyay and Michael E. Saks</span>
<span class="title">The Power of Super-logarithmic Number of Players</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.596">10.4230/LIPIcs.APPROX-RANDOM.2014.596</a>
</li>
<li>
<span class="authors">Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar, and Silvio Lattanzi</span>
<span class="title">On Reconstructing a Hidden Permutation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.604">10.4230/LIPIcs.APPROX-RANDOM.2014.604</a>
</li>
<li>
<span class="authors">Gil Cohen, Anat Ganor, and Ran Raz</span>
<span class="title">Two Sides of the Coin Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.618">10.4230/LIPIcs.APPROX-RANDOM.2014.618</a>
</li>
<li>
<span class="authors">Josep Díaz, Leslie Ann Goldberg, David Richerby, and Maria Serna</span>
<span class="title">Absorption Time of the Moran Process</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.630">10.4230/LIPIcs.APPROX-RANDOM.2014.630</a>
</li>
<li>
<span class="authors">Chandan Dubey and Thomas Holenstein</span>
<span class="title">Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.643">10.4230/LIPIcs.APPROX-RANDOM.2014.643</a>
</li>
<li>
<span class="authors">Nathanaël François, Rahul Jain, and Frédéric Magniez</span>
<span class="title">Unidirectional Input/Output Streaming Complexity of Reversal and Sorting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.654">10.4230/LIPIcs.APPROX-RANDOM.2014.654</a>
</li>
<li>
<span class="authors">Hu Fu and Robert Kleinberg</span>
<span class="title">Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.669">10.4230/LIPIcs.APPROX-RANDOM.2014.669</a>
</li>
<li>
<span class="authors">Andreas Galanis, Daniel Stefankovic, Eric Vigoda, and Linji Yang</span>
<span class="title">Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.677">10.4230/LIPIcs.APPROX-RANDOM.2014.677</a>
</li>
<li>
<span class="authors">Anat Ganor and Ran Raz</span>
<span class="title">Space Pseudorandom Generators by Communication Complexity Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.692">10.4230/LIPIcs.APPROX-RANDOM.2014.692</a>
</li>
<li>
<span class="authors">Oded Goldreich</span>
<span class="title">On Multiple Input Problems in Property Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.704">10.4230/LIPIcs.APPROX-RANDOM.2014.704</a>
</li>
<li>
<span class="authors">Mika Göös and Thomas Watson</span>
<span class="title">Communication Complexity of Set-Disjointness for All Probabilities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.721">10.4230/LIPIcs.APPROX-RANDOM.2014.721</a>
</li>
<li>
<span class="authors">Alan Guo and Madhu Sudan</span>
<span class="title">List Decoding Group Homomorphisms Between Supersolvable Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.737">10.4230/LIPIcs.APPROX-RANDOM.2014.737</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami and Carol Wang</span>
<span class="title">Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.748">10.4230/LIPIcs.APPROX-RANDOM.2014.748</a>
</li>
<li>
<span class="authors">T. S. Jayram and Jan Vondrák</span>
<span class="title">Exchangeability and Realizability: De Finetti Theorems on Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.762">10.4230/LIPIcs.APPROX-RANDOM.2014.762</a>
</li>
<li>
<span class="authors">Varun Kanade, Elchanan Mossel, and Tselil Schramm</span>
<span class="title">Global and Local Information in Clustering Labeled Block Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.779">10.4230/LIPIcs.APPROX-RANDOM.2014.779</a>
</li>
<li>
<span class="authors">Adam Klivans and Pravesh Kothari</span>
<span class="title">Embedding Hard Learning Problems Into Gaussian Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.793">10.4230/LIPIcs.APPROX-RANDOM.2014.793</a>
</li>
<li>
<span class="authors">Michael Krivelevich, Daniel Reichman, and Wojciech Samotij</span>
<span class="title">Smoothed Analysis on Connected Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.810">10.4230/LIPIcs.APPROX-RANDOM.2014.810</a>
</li>
<li>
<span class="authors">Reut Levi, Dana Ron, and Ronitt Rubinfeld</span>
<span class="title">Local Algorithms for Sparse Spanning Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.826">10.4230/LIPIcs.APPROX-RANDOM.2014.826</a>
</li>
<li>
<span class="authors">Jingcheng Liu, Pinyan Lu, and Chihao Zhang</span>
<span class="title">The Complexity of Ferromagnetic Two-spin Systems with External Fields</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.843">10.4230/LIPIcs.APPROX-RANDOM.2014.843</a>
</li>
<li>
<span class="authors">Abbas Mehrabian and Nick Wormald</span>
<span class="title">It’s a Small World for Random Surfers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.857">10.4230/LIPIcs.APPROX-RANDOM.2014.857</a>
</li>
<li>
<span class="authors">Raghu Meka, Omer Reingold, and Yuan Zhou</span>
<span class="title">Deterministic Coupon Collection and Better Strong Dispersers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.872">10.4230/LIPIcs.APPROX-RANDOM.2014.872</a>
</li>
<li>
<span class="authors">Thomas Steinke, Salil Vadhan, and Andrew Wan</span>
<span class="title">Pseudorandomness and Fourier Growth Bounds for Width-3 Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.885">10.4230/LIPIcs.APPROX-RANDOM.2014.885</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