@Proceedings{blais_et_al:LIPIcs.APPROX-RANDOM.2018,
title = {{LIPIcs, Volume 116, APPROX/RANDOM'18, Complete Volume}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018},
URN = {urn:nbn:de:0030-drops-97254},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018},
annote = {Keywords: Mathematics of computing, Theory of computation}
}
@InProceedings{blais_et_al:LIPIcs.APPROX-RANDOM.2018.0,
author = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.0},
URN = {urn:nbn:de:0030-drops-94043},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{agrawal_et_al:LIPIcs.APPROX-RANDOM.2018.1,
author = {Agrawal, Akanksha and Lokshtanov, Daniel and Misra, Pranabendu and Saurabh, Saket and Zehavi, Meirav},
title = {{Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {1:1--1:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.1},
URN = {urn:nbn:de:0030-drops-94058},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.1},
annote = {Keywords: Approximation Algorithms, Planar- F-Deletion, Separator}
}
@InProceedings{bandyapadhyay_et_al:LIPIcs.APPROX-RANDOM.2018.2,
author = {Bandyapadhyay, Sayan and Kumar, Neeraj and Suri, Subhash and Varadarajan, Kasturi},
title = {{Improved Approximation Bounds for the Minimum Constraint Removal Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {2:1--2:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.2},
URN = {urn:nbn:de:0030-drops-94066},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.2},
annote = {Keywords: Minimum Constraint Removal, Minimum Color Path, Barrier Resilience, Obstacle Removal, Obstacle Free Path, Approximation}
}
@InProceedings{becker:LIPIcs.APPROX-RANDOM.2018.3,
author = {Becker, Amariah},
title = {{A Tight 4/3 Approximation for Capacitated Vehicle Routing in Trees}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.3},
URN = {urn:nbn:de:0030-drops-94075},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.3},
annote = {Keywords: Approximation algorithms, Graph algorithms, Capacitated vehicle routing}
}
@InProceedings{bhaskara_et_al:LIPIcs.APPROX-RANDOM.2018.4,
author = {Bhaskara, Aditya and Kumar, Srivatsan},
title = {{Low Rank Approximation in the Presence of Outliers}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {4:1--4:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.4},
URN = {urn:nbn:de:0030-drops-94087},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.4},
annote = {Keywords: Low rank approximation, PCA, Robustness to outliers}
}
@InProceedings{borodin_et_al:LIPIcs.APPROX-RANDOM.2018.5,
author = {Borodin, Allan and Karavasilis, Christodoulos and Pankratov, Denis},
title = {{Greedy Bipartite Matching in Random Type Poisson Arrival Model}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {5:1--5:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.5},
URN = {urn:nbn:de:0030-drops-94098},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.5},
annote = {Keywords: bipartite matching, stochastic input models, online algorithms, greedy algorithms}
}
@InProceedings{braverman_et_al:LIPIcs.APPROX-RANDOM.2018.6,
author = {Braverman, Mark and Ko, Young Kun},
title = {{Semi-Direct Sum Theorem and Nearest Neighbor under l\underlineinfty}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {6:1--6:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.6},
URN = {urn:nbn:de:0030-drops-94101},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.6},
annote = {Keywords: Asymmetric Communication Lower Bound, Data Structure Lower Bound, Nearest Neighbor Search}
}
@InProceedings{braverman_et_al:LIPIcs.APPROX-RANDOM.2018.7,
author = {Braverman, Vladimir and Grigorescu, Elena and Lang, Harry and Woodruff, David P. and Zhou, Samson},
title = {{Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {7:1--7:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.7},
URN = {urn:nbn:de:0030-drops-94118},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.7},
annote = {Keywords: Streaming algorithms, sliding windows, heavy hitters, distinct elements}
}
@InProceedings{chalermsook_et_al:LIPIcs.APPROX-RANDOM.2018.8,
author = {Chalermsook, Parinya and Das, Syamantak and Even, Guy and Laekhanukit, Bundit and Vaz, Daniel},
title = {{Survivable Network Design for Group Connectivity in Low-Treewidth Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {8:1--8:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.8},
URN = {urn:nbn:de:0030-drops-94127},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.8},
annote = {Keywords: Approximation Algorithms, Hardness of Approximation, Survivable Network Design, Group Steiner Tree}
}
@InProceedings{chekuri_et_al:LIPIcs.APPROX-RANDOM.2018.9,
author = {Chekuri, Chandra and Gupta, Shalmoli},
title = {{Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {9:1--9:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.9},
URN = {urn:nbn:de:0030-drops-94136},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.9},
annote = {Keywords: Clustering, Perturbation Resilience, LP Integrality, Outliers, Beyond Worst Case Analysis}
}
@InProceedings{chlamtac_et_al:LIPIcs.APPROX-RANDOM.2018.10,
author = {Chlamt\'{a}c, Eden and Manurangsi, Pasin},
title = {{Sherali-Adams Integrality Gaps Matching the Log-Density Threshold}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {10:1--10:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.10},
URN = {urn:nbn:de:0030-drops-94142},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.10},
annote = {Keywords: Approximation algorithms, integrality gaps, lift-and-project, log-density, Densest k-Subgraph}
}
@InProceedings{eden_et_al:LIPIcs.APPROX-RANDOM.2018.11,
author = {Eden, Talya and Rosenbaum, Will},
title = {{Lower Bounds for Approximating Graph Parameters via Communication Complexity}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {11:1--11:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.11},
URN = {urn:nbn:de:0030-drops-94156},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.11},
annote = {Keywords: sublinear graph parameter estimation, lower bounds, communication complexity}
}
@InProceedings{ganor_et_al:LIPIcs.APPROX-RANDOM.2018.12,
author = {Ganor, Anat and C. S., Karthik},
title = {{Communication Complexity of Correlated Equilibrium with Small Support}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {12:1--12:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.12},
URN = {urn:nbn:de:0030-drops-94163},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.12},
annote = {Keywords: Correlated equilibrium, Nash equilibrium, Communication complexity}
}
@InProceedings{haviv:LIPIcs.APPROX-RANDOM.2018.13,
author = {Haviv, Ishay},
title = {{On Minrank and the Lov\'{a}sz Theta Function}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {13:1--13:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.13},
URN = {urn:nbn:de:0030-drops-94170},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.13},
annote = {Keywords: Minrank, Theta Function, Shannon capacity, Multivariate polynomials, Higher incidence matrices}
}
@InProceedings{huang_et_al:LIPIcs.APPROX-RANDOM.2018.14,
author = {Huang, Zhiyi and Kang, Ning and Tang, Zhihao Gavin and Wu, Xiaowei and Zhang, Yuhao},
title = {{Online Makespan Minimization: The Power of Restart}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {14:1--14:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.14},
URN = {urn:nbn:de:0030-drops-94182},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.14},
annote = {Keywords: Online Scheduling, Makespan Minimization, Identical Machines}
}
@InProceedings{krishnan_et_al:LIPIcs.APPROX-RANDOM.2018.15,
author = {Krishnan, Aditya and Mohanty, Sidhanth and Woodruff, David P.},
title = {{On Sketching the q to p Norms}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {15:1--15:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.15},
URN = {urn:nbn:de:0030-drops-94192},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.15},
annote = {Keywords: Dimensionality Reduction, Norms, Sketching, Streaming}
}
@InProceedings{kulkarni_et_al:LIPIcs.APPROX-RANDOM.2018.16,
author = {Kulkarni, Janardhan and Li, Shi},
title = {{Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {16:1--16:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.16},
URN = {urn:nbn:de:0030-drops-94205},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.16},
annote = {Keywords: Approximation, Weighted Flow Time, Concurrent Open Shop, Precedence Constraints}
}
@InProceedings{levi_et_al:LIPIcs.APPROX-RANDOM.2018.17,
author = {Levi, Amit and Yoshida, Yuichi},
title = {{Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {17:1--17:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.17},
URN = {urn:nbn:de:0030-drops-94210},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.17},
annote = {Keywords: Qudratic function minimization, Approximation Algorithms, Matrix spectral decomposition, Graph limits}
}
@InProceedings{li_et_al:LIPIcs.APPROX-RANDOM.2018.18,
author = {Li, Yi and Nakos, Vasileios},
title = {{Deterministic Heavy Hitters with Sublinear Query Time}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {18:1--18:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.18},
URN = {urn:nbn:de:0030-drops-94221},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.18},
annote = {Keywords: heavy hitters, turnstile model, sketching algorithm, strongly explicit}
}
@InProceedings{li_et_al:LIPIcs.APPROX-RANDOM.2018.19,
author = {Li, Yi and Nakos, Vasileios and Woodruff, David P.},
title = {{On Low-Risk Heavy Hitters and Sparse Recovery Schemes}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {19:1--19:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.19},
URN = {urn:nbn:de:0030-drops-94237},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.19},
annote = {Keywords: heavy hitters, sparse recovery, turnstile model, spike covariance model, lower bounds}
}
@InProceedings{manurangsi_et_al:LIPIcs.APPROX-RANDOM.2018.20,
author = {Manurangsi, Pasin and Trevisan, Luca},
title = {{Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {20:1--20:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.20},
URN = {urn:nbn:de:0030-drops-94241},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.20},
annote = {Keywords: Approximation algorithms, Exponential-time algorithms, Vertex Cover, Sparsest Cut, Balanced Separator}
}
@InProceedings{narayanan:LIPIcs.APPROX-RANDOM.2018.21,
author = {Narayanan, Shyam},
title = {{Deterministic O(1)-Approximation Algorithms to 1-Center Clustering with Outliers}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {21:1--21:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.21},
URN = {urn:nbn:de:0030-drops-94253},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.21},
annote = {Keywords: Deterministic, Approximation Algorithm, Cluster, Statistic}
}
@InProceedings{reddy_et_al:LIPIcs.APPROX-RANDOM.2018.22,
author = {Reddy, Goonwanth and Vaze, Rahul},
title = {{Robust Online Speed Scaling With Deadline Uncertainty}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {22:1--22:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.22},
URN = {urn:nbn:de:0030-drops-94269},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.22},
annote = {Keywords: Online Algorithms, Speed Scaling, Greedy Algorithms, Scheduling}
}
@InProceedings{santiago_et_al:LIPIcs.APPROX-RANDOM.2018.23,
author = {Santiago, Richard and Shepherd, F. Bruce},
title = {{Multi-Agent Submodular Optimization}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {23:1--23:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.23},
URN = {urn:nbn:de:0030-drops-94276},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.23},
annote = {Keywords: submodular optimization, multi-agent, approximation algorithms}
}
@InProceedings{sarpatwar_et_al:LIPIcs.APPROX-RANDOM.2018.24,
author = {Sarpatwar, Kanthi and Schieber, Baruch and Shachnai, Hadas},
title = {{Generalized Assignment of Time-Sensitive Item Groups}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {24:1--24:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.24},
URN = {urn:nbn:de:0030-drops-94287},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.24},
annote = {Keywords: Approximation Algorithms, Packing and Covering problems, Generalized Assignment problem}
}
@InProceedings{sra_et_al:LIPIcs.APPROX-RANDOM.2018.25,
author = {Sra, Suvrit and Vishnoi, Nisheeth K. and Yildiz, Ozan},
title = {{On Geodesically Convex Formulations for the Brascamp-Lieb Constant}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {25:1--25:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.25},
URN = {urn:nbn:de:0030-drops-94296},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.25},
annote = {Keywords: Geodesic convexity, positive definite cone, geodesics, Brascamp-Lieb constant}
}
@InProceedings{swernofsky:LIPIcs.APPROX-RANDOM.2018.26,
author = {Swernofsky, Joseph},
title = {{Tensor Rank is Hard to Approximate}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {26:1--26:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.26},
URN = {urn:nbn:de:0030-drops-94309},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.26},
annote = {Keywords: tensor rank, high rank tensor, slice elimination, approximation algorithm, hardness of approximation}
}
@InProceedings{wei_et_al:LIPIcs.APPROX-RANDOM.2018.27,
author = {Wei, Hao-Ting and Hon, Wing-Kai and Horn, Paul and Liao, Chung-Shou and Sadakane, Kunihiko},
title = {{An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {27:1--27:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.27},
URN = {urn:nbn:de:0030-drops-94312},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.27},
annote = {Keywords: approximation algorithm, dynamic algorithm, primal-dual, vertex cover}
}
@InProceedings{wiese:LIPIcs.APPROX-RANDOM.2018.28,
author = {Wiese, Andreas},
title = {{Fixed-Parameter Approximation Schemes for Weighted Flowtime}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {28:1--28:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.28},
URN = {urn:nbn:de:0030-drops-94326},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.28},
annote = {Keywords: Scheduling, fixed-parameter algorithms, approximation algorithms, approximation schemes}
}
@InProceedings{babai_et_al:LIPIcs.APPROX-RANDOM.2018.29,
author = {Babai, L\'{a}szl\'{o} and Black, Timothy J. F. and Wuu, Angela},
title = {{List-Decoding Homomorphism Codes with Arbitrary Codomains}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {29:1--29:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.29},
URN = {urn:nbn:de:0030-drops-94338},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.29},
annote = {Keywords: Error-correcting codes, Local algorithms, Local list-decoding, Finite groups, Homomorphism codes}
}
@InProceedings{beigi_et_al:LIPIcs.APPROX-RANDOM.2018.30,
author = {Beigi, Salman and Bogdanov, Andrej and Etesami, Omid and Guo, Siyao},
title = {{Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {30:1--30:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.30},
URN = {urn:nbn:de:0030-drops-94349},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.30},
annote = {Keywords: feasibility of randomness extraction, extractor lower bounds, martingales}
}
@InProceedings{belovs:LIPIcs.APPROX-RANDOM.2018.31,
author = {Belovs, Aleksandrs},
title = {{Adaptive Lower Bound for Testing Monotonicity on the Line}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {31:1--31:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.31},
URN = {urn:nbn:de:0030-drops-94350},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.31},
annote = {Keywords: property testing, monotonicity on the line, monotonicity on the hypergrid}
}
@InProceedings{blanca_et_al:LIPIcs.APPROX-RANDOM.2018.32,
author = {Blanca, Antonio and Chen, Zongchen and Vigoda, Eric},
title = {{Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness Region}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {32:1--32:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.32},
URN = {urn:nbn:de:0030-drops-94365},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.32},
annote = {Keywords: Swendsen-Wang dynamics, mixing time, relaxation time, spatial mixing, censoring}
}
@InProceedings{blanca_et_al:LIPIcs.APPROX-RANDOM.2018.33,
author = {Blanca, Antonio and Galanis, Andreas and Goldberg, Leslie Ann and Stefankovic, Daniel and Vigoda, Eric and Yang, Kuan},
title = {{Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {33:1--33:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.33},
URN = {urn:nbn:de:0030-drops-94371},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.33},
annote = {Keywords: sampling, Potts model, random regular graphs, phase transitions}
}
@InProceedings{blasiok_et_al:LIPIcs.APPROX-RANDOM.2018.34,
author = {Blasiok, Jaroslaw and Guruswami, Venkatesan and Sudan, Madhu},
title = {{Polar Codes with Exponentially Small Error at Finite Block Length}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {34:1--34:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.34},
URN = {urn:nbn:de:0030-drops-94382},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.34},
annote = {Keywords: Polar codes, error exponent, rate of polarization}
}
@InProceedings{bun_et_al:LIPIcs.APPROX-RANDOM.2018.35,
author = {Bun, Mark and Thaler, Justin},
title = {{Approximate Degree and the Complexity of Depth Three Circuits}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {35:1--35:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.35},
URN = {urn:nbn:de:0030-drops-94390},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.35},
annote = {Keywords: approximate degree, communication complexity, learning theory, polynomial approximation, threshold circuits}
}
@InProceedings{carstens_et_al:LIPIcs.APPROX-RANDOM.2018.36,
author = {Carstens, Corrie Jacobien and Kleer, Pieter},
title = {{Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {36:1--36:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.36},
URN = {urn:nbn:de:0030-drops-94403},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.36},
annote = {Keywords: Binary matrix, graph sampling, Curveball, switch, Markov chain decomposition, Johnson graph}
}
@InProceedings{cheng_et_al:LIPIcs.APPROX-RANDOM.2018.37,
author = {Cheng, Kuan and Li, Xin},
title = {{Randomness Extraction in AC0 and with Small Locality}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {37:1--37:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.37},
URN = {urn:nbn:de:0030-drops-94414},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.37},
annote = {Keywords: Randomness Extraction, AC0, Locality, Pseudorandom Generator}
}
@InProceedings{dikstein_et_al:LIPIcs.APPROX-RANDOM.2018.38,
author = {Dikstein, Yotam and Dinur, Irit and Filmus, Yuval and Harsha, Prahladh},
title = {{Boolean Function Analysis on High-Dimensional Expanders}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {38:1--38:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.38},
URN = {urn:nbn:de:0030-drops-94421},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.38},
annote = {Keywords: high dimensional expanders, Boolean function analysis, sparse model}
}
@InProceedings{gracar_et_al:LIPIcs.APPROX-RANDOM.2018.39,
author = {Gracar, Peter and Stauffer, Alexandre},
title = {{Percolation of Lipschitz Surface and Tight Bounds on the Spread of Information Among Mobile Agents}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {39:1--39:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.39},
URN = {urn:nbn:de:0030-drops-94439},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.39},
annote = {Keywords: Lipschitz surface, spread of information, flooding time, moving agents}
}
@InProceedings{grigorescu_et_al:LIPIcs.APPROX-RANDOM.2018.40,
author = {Grigorescu, Elena and Kumar, Akash and Wimmer, Karl},
title = {{Flipping out with Many Flips: Hardness of Testing k-Monotonicity}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {40:1--40:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.40},
URN = {urn:nbn:de:0030-drops-94448},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.40},
annote = {Keywords: Property Testing, Boolean Functions, k-Monotonicity, Lower Bounds}
}
@InProceedings{guruswami_et_al:LIPIcs.APPROX-RANDOM.2018.41,
author = {Guruswami, Venkatesan and Xing, Chaoping and Yuan, Chen},
title = {{How Long Can Optimal Locally Repairable Codes Be?}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {41:1--41:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.41},
URN = {urn:nbn:de:0030-drops-94458},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.41},
annote = {Keywords: Locally Repairable Code, Singleton Bound}
}
@InProceedings{haviv:LIPIcs.APPROX-RANDOM.2018.42,
author = {Haviv, Ishay},
title = {{On Minrank and Forbidden Subgraphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {42:1--42:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.42},
URN = {urn:nbn:de:0030-drops-94461},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.42},
annote = {Keywords: Minrank, Forbidden subgraphs, Shannon capacity, Circuit Complexity}
}
@InProceedings{hoza_et_al:LIPIcs.APPROX-RANDOM.2018.43,
author = {Hoza, William M. and Klivans, Adam R.},
title = {{Preserving Randomness for Adaptive Algorithms}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {43:1--43:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.43},
URN = {urn:nbn:de:0030-drops-94477},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.43},
annote = {Keywords: pseudorandomness, adaptivity, estimation}
}
@InProceedings{iliopoulos:LIPIcs.APPROX-RANDOM.2018.44,
author = {Iliopoulos, Fotis},
title = {{Commutative Algorithms Approximate the LLL-distribution}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {44:1--44:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.44},
URN = {urn:nbn:de:0030-drops-94487},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.44},
annote = {Keywords: Lovasz Local Lemma, Local Search, Commutativity, LLL-distribution, Coloring Triangle-free Graphs}
}
@InProceedings{johansson:LIPIcs.APPROX-RANDOM.2018.45,
author = {Johansson, Tony},
title = {{The Cover Time of a Biased Random Walk on a Random Regular Graph of Odd Degree}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {45:1--45:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.45},
URN = {urn:nbn:de:0030-drops-94494},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.45},
annote = {Keywords: Random walk, random regular graph, cover time}
}
@InProceedings{kabanets_et_al:LIPIcs.APPROX-RANDOM.2018.46,
author = {Kabanets, Valentine and Lu, Zhenjian},
title = {{Satisfiability and Derandomization for Small Polynomial Threshold Circuits}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {46:1--46:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.46},
URN = {urn:nbn:de:0030-drops-94507},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.46},
annote = {Keywords: constant-depth circuits, polynomial threshold functions, circuit analysis algorithms, SAT, derandomization, quantified derandomization, pseudorandom generators.}
}
@InProceedings{kaufman_et_al:LIPIcs.APPROX-RANDOM.2018.47,
author = {Kaufman, Tali and Oppenheim, Izhar},
title = {{High Order Random Walks: Beyond Spectral Gap}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {47:1--47:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.47},
URN = {urn:nbn:de:0030-drops-94516},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.47},
annote = {Keywords: High Dimensional Expanders, Simplicial Complexes, Random Walk}
}
@InProceedings{koroth_et_al:LIPIcs.APPROX-RANDOM.2018.48,
author = {Koroth, Sajin and Meir, Or},
title = {{Improved Composition Theorems for Functions and Relations}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {48:1--48:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.48},
URN = {urn:nbn:de:0030-drops-94525},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.48},
annote = {Keywords: circuit complexity, communication complexity, KRW conjecture, composition}
}
@InProceedings{leshkowitz:LIPIcs.APPROX-RANDOM.2018.49,
author = {Leshkowitz, Maya},
title = {{Round Complexity Versus Randomness Complexity in Interactive Proofs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {49:1--49:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.49},
URN = {urn:nbn:de:0030-drops-94530},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.49},
annote = {Keywords: Interactive Proofs}
}
@InProceedings{li_et_al:LIPIcs.APPROX-RANDOM.2018.50,
author = {Li, Ray and Wootters, Mary},
title = {{Improved List-Decodability of Random Linear Binary Codes}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {50:1--50:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.50},
URN = {urn:nbn:de:0030-drops-94547},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.50},
annote = {Keywords: List-decoding, Random linear codes, Rank-metric codes}
}
@InProceedings{li_et_al:LIPIcs.APPROX-RANDOM.2018.51,
author = {Li, Xin and Lovett, Shachar and Zhang, Jiapeng},
title = {{Sunflowers and Quasi-Sunflowers from Randomness Extractors}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {51:1--51:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.51},
URN = {urn:nbn:de:0030-drops-94555},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.51},
annote = {Keywords: Sunflower conjecture, Quasi-sunflowers, Randomness Extractors}
}
@InProceedings{liu:LIPIcs.APPROX-RANDOM.2018.52,
author = {Liu, Tianyu},
title = {{Torpid Mixing of Markov Chains for the Six-vertex Model on Z^2}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {52:1--52:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.52},
URN = {urn:nbn:de:0030-drops-94568},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.52},
annote = {Keywords: the six-vertex model, Eulerian orientations, square lattice, torpid mixing}
}
@InProceedings{nakar_et_al:LIPIcs.APPROX-RANDOM.2018.53,
author = {Nakar, Yonatan and Ron, Dana},
title = {{On the Testability of Graph Partition Properties}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {53:1--53:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.53},
URN = {urn:nbn:de:0030-drops-94572},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.53},
annote = {Keywords: Graph Partition Properties}
}
@InProceedings{odonnell_et_al:LIPIcs.APPROX-RANDOM.2018.54,
author = {O'Donnell, Ryan and Zhao, Yu},
title = {{On Closeness to k-Wise Uniformity}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {54:1--54:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.54},
URN = {urn:nbn:de:0030-drops-94581},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.54},
annote = {Keywords: k-wise independence, property testing, Fourier analysis, Boolean function}
}
@InProceedings{carbonioliveira_et_al:LIPIcs.APPROX-RANDOM.2018.55,
author = {Carboni Oliveira, Igor and Santhanam, Rahul},
title = {{Pseudo-Derandomizing Learning and Approximation}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {55:1--55:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.55},
URN = {urn:nbn:de:0030-drops-94598},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.55},
annote = {Keywords: derandomization, learning, approximation, boolean circuits}
}
@InProceedings{servedio_et_al:LIPIcs.APPROX-RANDOM.2018.56,
author = {Servedio, Rocco A. and Tan, Li-Yang},
title = {{Luby-Velickovic-Wigderson Revisited: Improved Correlation Bounds and Pseudorandom Generators for Depth-Two Circuits}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {56:1--56:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.56},
URN = {urn:nbn:de:0030-drops-94601},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.56},
annote = {Keywords: Pseudorandom generators, correlation bounds, constant-depth circuits}
}
@InProceedings{vardi:LIPIcs.APPROX-RANDOM.2018.57,
author = {Vardi, Shai},
title = {{Randomly Coloring Graphs of Logarithmically Bounded Pathwidth}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {57:1--57:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.57},
URN = {urn:nbn:de:0030-drops-94618},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.57},
annote = {Keywords: Random coloring, Glauber dynamics, Markov-chain Monte Carlo}
}
@InProceedings{viderman:LIPIcs.APPROX-RANDOM.2018.58,
author = {Viderman, Michael},
title = {{Explicit Strong LTCs with Inverse Poly-Log Rate and Constant Soundness}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {58:1--58:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-085-9},
ISSN = {1868-8969},
year = {2018},
volume = {116},
editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.58},
URN = {urn:nbn:de:0030-drops-94620},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.58},
annote = {Keywords: Error-Correcting Codes, Tensor Products, Locally Testable Codes}
}
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