<h2>LIPIcs, Volume 116, APPROX/RANDOM 2018</h2>
<ul>
<li>
<span class="authors">Eric Blais, Klaus Jansen, José D. P. Rolim, and David Steurer</span>
<span class="title">LIPIcs, Volume 116, APPROX/RANDOM'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018">10.4230/LIPIcs.APPROX-RANDOM.2018</a>
</li>
<li>
<span class="authors">Eric Blais, Klaus Jansen, José D. P. Rolim, and David Steurer</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.0">10.4230/LIPIcs.APPROX-RANDOM.2018.0</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.1">10.4230/LIPIcs.APPROX-RANDOM.2018.1</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, and Kasturi Varadarajan</span>
<span class="title">Improved Approximation Bounds for the Minimum Constraint Removal Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.2">10.4230/LIPIcs.APPROX-RANDOM.2018.2</a>
</li>
<li>
<span class="authors">Amariah Becker</span>
<span class="title">A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.3">10.4230/LIPIcs.APPROX-RANDOM.2018.3</a>
</li>
<li>
<span class="authors">Aditya Bhaskara and Srivatsan Kumar</span>
<span class="title">Low Rank Approximation in the Presence of Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.4">10.4230/LIPIcs.APPROX-RANDOM.2018.4</a>
</li>
<li>
<span class="authors">Allan Borodin, Christodoulos Karavasilis, and Denis Pankratov</span>
<span class="title">Greedy Bipartite Matching in Random Type Poisson Arrival Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.5">10.4230/LIPIcs.APPROX-RANDOM.2018.5</a>
</li>
<li>
<span class="authors">Mark Braverman and Young Kun Ko</span>
<span class="title">Semi-Direct Sum Theorem and Nearest Neighbor under l_infty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.6">10.4230/LIPIcs.APPROX-RANDOM.2018.6</a>
</li>
<li>
<span class="authors">Vladimir Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff, and Samson Zhou</span>
<span class="title">Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.7">10.4230/LIPIcs.APPROX-RANDOM.2018.7</a>
</li>
<li>
<span class="authors">Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, and Daniel Vaz</span>
<span class="title">Survivable Network Design for Group Connectivity in Low-Treewidth Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.8">10.4230/LIPIcs.APPROX-RANDOM.2018.8</a>
</li>
<li>
<span class="authors">Chandra Chekuri and Shalmoli Gupta</span>
<span class="title">Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.9">10.4230/LIPIcs.APPROX-RANDOM.2018.9</a>
</li>
<li>
<span class="authors">Eden Chlamtác and Pasin Manurangsi</span>
<span class="title">Sherali-Adams Integrality Gaps Matching the Log-Density Threshold</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.10">10.4230/LIPIcs.APPROX-RANDOM.2018.10</a>
</li>
<li>
<span class="authors">Talya Eden and Will Rosenbaum</span>
<span class="title">Lower Bounds for Approximating Graph Parameters via Communication Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.11">10.4230/LIPIcs.APPROX-RANDOM.2018.11</a>
</li>
<li>
<span class="authors">Anat Ganor and Karthik C. S.</span>
<span class="title">Communication Complexity of Correlated Equilibrium with Small Support</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.12">10.4230/LIPIcs.APPROX-RANDOM.2018.12</a>
</li>
<li>
<span class="authors">Ishay Haviv</span>
<span class="title">On Minrank and the Lovász Theta Function</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.13">10.4230/LIPIcs.APPROX-RANDOM.2018.13</a>
</li>
<li>
<span class="authors">Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, and Yuhao Zhang</span>
<span class="title">Online Makespan Minimization: The Power of Restart</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.14">10.4230/LIPIcs.APPROX-RANDOM.2018.14</a>
</li>
<li>
<span class="authors">Aditya Krishnan, Sidhanth Mohanty, and David P. Woodruff</span>
<span class="title">On Sketching the q to p Norms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.15">10.4230/LIPIcs.APPROX-RANDOM.2018.15</a>
</li>
<li>
<span class="authors">Janardhan Kulkarni and Shi Li</span>
<span class="title">Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.16">10.4230/LIPIcs.APPROX-RANDOM.2018.16</a>
</li>
<li>
<span class="authors">Amit Levi and Yuichi Yoshida</span>
<span class="title">Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.17">10.4230/LIPIcs.APPROX-RANDOM.2018.17</a>
</li>
<li>
<span class="authors">Yi Li and Vasileios Nakos</span>
<span class="title">Deterministic Heavy Hitters with Sublinear Query Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.18">10.4230/LIPIcs.APPROX-RANDOM.2018.18</a>
</li>
<li>
<span class="authors">Yi Li, Vasileios Nakos, and David P. Woodruff</span>
<span class="title">On Low-Risk Heavy Hitters and Sparse Recovery Schemes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.19">10.4230/LIPIcs.APPROX-RANDOM.2018.19</a>
</li>
<li>
<span class="authors">Pasin Manurangsi and Luca Trevisan</span>
<span class="title">Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.20">10.4230/LIPIcs.APPROX-RANDOM.2018.20</a>
</li>
<li>
<span class="authors">Shyam Narayanan</span>
<span class="title">Deterministic O(1)-Approximation Algorithms to 1-Center Clustering with Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.21">10.4230/LIPIcs.APPROX-RANDOM.2018.21</a>
</li>
<li>
<span class="authors">Goonwanth Reddy and Rahul Vaze</span>
<span class="title">Robust Online Speed Scaling With Deadline Uncertainty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.22">10.4230/LIPIcs.APPROX-RANDOM.2018.22</a>
</li>
<li>
<span class="authors">Richard Santiago and F. Bruce Shepherd</span>
<span class="title">Multi-Agent Submodular Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.23">10.4230/LIPIcs.APPROX-RANDOM.2018.23</a>
</li>
<li>
<span class="authors">Kanthi Sarpatwar, Baruch Schieber, and Hadas Shachnai</span>
<span class="title">Generalized Assignment of Time-Sensitive Item Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.24">10.4230/LIPIcs.APPROX-RANDOM.2018.24</a>
</li>
<li>
<span class="authors">Suvrit Sra, Nisheeth K. Vishnoi, and Ozan Yildiz</span>
<span class="title">On Geodesically Convex Formulations for the Brascamp-Lieb Constant</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.25">10.4230/LIPIcs.APPROX-RANDOM.2018.25</a>
</li>
<li>
<span class="authors">Joseph Swernofsky</span>
<span class="title">Tensor Rank is Hard to Approximate</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.26">10.4230/LIPIcs.APPROX-RANDOM.2018.26</a>
</li>
<li>
<span class="authors">Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, and Kunihiko Sadakane</span>
<span class="title">An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.27">10.4230/LIPIcs.APPROX-RANDOM.2018.27</a>
</li>
<li>
<span class="authors">Andreas Wiese</span>
<span class="title">Fixed-Parameter Approximation Schemes for Weighted Flowtime</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.28">10.4230/LIPIcs.APPROX-RANDOM.2018.28</a>
</li>
<li>
<span class="authors">László Babai, Timothy J. F. Black, and Angela Wuu</span>
<span class="title">List-Decoding Homomorphism Codes with Arbitrary Codomains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.29">10.4230/LIPIcs.APPROX-RANDOM.2018.29</a>
</li>
<li>
<span class="authors">Salman Beigi, Andrej Bogdanov, Omid Etesami, and Siyao Guo</span>
<span class="title">Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.30">10.4230/LIPIcs.APPROX-RANDOM.2018.30</a>
</li>
<li>
<span class="authors">Aleksandrs Belovs</span>
<span class="title">Adaptive Lower Bound for Testing Monotonicity on the Line</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.31">10.4230/LIPIcs.APPROX-RANDOM.2018.31</a>
</li>
<li>
<span class="authors">Antonio Blanca, Zongchen Chen, and Eric Vigoda</span>
<span class="title">Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.32">10.4230/LIPIcs.APPROX-RANDOM.2018.32</a>
</li>
<li>
<span class="authors">Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, and Kuan Yang</span>
<span class="title">Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.33">10.4230/LIPIcs.APPROX-RANDOM.2018.33</a>
</li>
<li>
<span class="authors">Jaroslaw Blasiok, Venkatesan Guruswami, and Madhu Sudan</span>
<span class="title">Polar Codes with Exponentially Small Error at Finite Block Length</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.34">10.4230/LIPIcs.APPROX-RANDOM.2018.34</a>
</li>
<li>
<span class="authors">Mark Bun and Justin Thaler</span>
<span class="title">Approximate Degree and the Complexity of Depth Three Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.35">10.4230/LIPIcs.APPROX-RANDOM.2018.35</a>
</li>
<li>
<span class="authors">Corrie Jacobien Carstens and Pieter Kleer</span>
<span class="title">Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.36">10.4230/LIPIcs.APPROX-RANDOM.2018.36</a>
</li>
<li>
<span class="authors">Kuan Cheng and Xin Li</span>
<span class="title">Randomness Extraction in AC0 and with Small Locality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.37">10.4230/LIPIcs.APPROX-RANDOM.2018.37</a>
</li>
<li>
<span class="authors">Yotam Dikstein, Irit Dinur, Yuval Filmus, and Prahladh Harsha</span>
<span class="title">Boolean Function Analysis on High-Dimensional Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.38">10.4230/LIPIcs.APPROX-RANDOM.2018.38</a>
</li>
<li>
<span class="authors">Peter Gracar and Alexandre Stauffer</span>
<span class="title">Percolation of Lipschitz Surface and Tight Bounds on the Spread of Information Among Mobile Agents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.39">10.4230/LIPIcs.APPROX-RANDOM.2018.39</a>
</li>
<li>
<span class="authors">Elena Grigorescu, Akash Kumar, and Karl Wimmer</span>
<span class="title">Flipping out with Many Flips: Hardness of Testing k-Monotonicity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.40">10.4230/LIPIcs.APPROX-RANDOM.2018.40</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami, Chaoping Xing, and Chen Yuan</span>
<span class="title">How Long Can Optimal Locally Repairable Codes Be?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.41">10.4230/LIPIcs.APPROX-RANDOM.2018.41</a>
</li>
<li>
<span class="authors">Ishay Haviv</span>
<span class="title">On Minrank and Forbidden Subgraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.42">10.4230/LIPIcs.APPROX-RANDOM.2018.42</a>
</li>
<li>
<span class="authors">William M. Hoza and Adam R. Klivans</span>
<span class="title">Preserving Randomness for Adaptive Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.43">10.4230/LIPIcs.APPROX-RANDOM.2018.43</a>
</li>
<li>
<span class="authors">Fotis Iliopoulos</span>
<span class="title">Commutative Algorithms Approximate the LLL-distribution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.44">10.4230/LIPIcs.APPROX-RANDOM.2018.44</a>
</li>
<li>
<span class="authors">Tony Johansson</span>
<span class="title">The Cover Time of a Biased Random Walk on a Random Regular Graph of Odd Degree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.45">10.4230/LIPIcs.APPROX-RANDOM.2018.45</a>
</li>
<li>
<span class="authors">Valentine Kabanets and Zhenjian Lu</span>
<span class="title">Satisfiability and Derandomization for Small Polynomial Threshold Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.46">10.4230/LIPIcs.APPROX-RANDOM.2018.46</a>
</li>
<li>
<span class="authors">Tali Kaufman and Izhar Oppenheim</span>
<span class="title">High Order Random Walks: Beyond Spectral Gap</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.47">10.4230/LIPIcs.APPROX-RANDOM.2018.47</a>
</li>
<li>
<span class="authors">Sajin Koroth and Or Meir</span>
<span class="title">Improved Composition Theorems for Functions and Relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.48">10.4230/LIPIcs.APPROX-RANDOM.2018.48</a>
</li>
<li>
<span class="authors">Maya Leshkowitz</span>
<span class="title">Round Complexity Versus Randomness Complexity in Interactive Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.49">10.4230/LIPIcs.APPROX-RANDOM.2018.49</a>
</li>
<li>
<span class="authors">Ray Li and Mary Wootters</span>
<span class="title">Improved List-Decodability of Random Linear Binary Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.50">10.4230/LIPIcs.APPROX-RANDOM.2018.50</a>
</li>
<li>
<span class="authors">Xin Li, Shachar Lovett, and Jiapeng Zhang</span>
<span class="title">Sunflowers and Quasi-Sunflowers from Randomness Extractors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.51">10.4230/LIPIcs.APPROX-RANDOM.2018.51</a>
</li>
<li>
<span class="authors">Tianyu Liu</span>
<span class="title">Torpid Mixing of Markov Chains for the Six-vertex Model on Z^2</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.52">10.4230/LIPIcs.APPROX-RANDOM.2018.52</a>
</li>
<li>
<span class="authors">Yonatan Nakar and Dana Ron</span>
<span class="title">On the Testability of Graph Partition Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.53">10.4230/LIPIcs.APPROX-RANDOM.2018.53</a>
</li>
<li>
<span class="authors">Ryan O'Donnell and Yu Zhao</span>
<span class="title">On Closeness to k-Wise Uniformity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.54">10.4230/LIPIcs.APPROX-RANDOM.2018.54</a>
</li>
<li>
<span class="authors">Igor Carboni Oliveira and Rahul Santhanam</span>
<span class="title">Pseudo-Derandomizing Learning and Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.55">10.4230/LIPIcs.APPROX-RANDOM.2018.55</a>
</li>
<li>
<span class="authors">Rocco A. Servedio and Li-Yang Tan</span>
<span class="title">Luby-Velickovic-Wigderson Revisited: Improved Correlation Bounds and Pseudorandom Generators for Depth-Two Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.56">10.4230/LIPIcs.APPROX-RANDOM.2018.56</a>
</li>
<li>
<span class="authors">Shai Vardi</span>
<span class="title">Randomly Coloring Graphs of Logarithmically Bounded Pathwidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.57">10.4230/LIPIcs.APPROX-RANDOM.2018.57</a>
</li>
<li>
<span class="authors">Michael Viderman</span>
<span class="title">Explicit Strong LTCs with Inverse Poly-Log Rate and Constant Soundness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.58">10.4230/LIPIcs.APPROX-RANDOM.2018.58</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