@Proceedings{achlioptas_et_al:LIPIcs.APPROX-RANDOM.2019,
title = {{LIPIcs, Volume 145, APPROX/RANDOM'19, Complete Volume}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019},
URN = {urn:nbn:de:0030-drops-113014},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019},
annote = {Keywords: Mathematics of computing; Theory of computation}
}
@InProceedings{achlioptas_et_al:LIPIcs.APPROX-RANDOM.2019.0,
author = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {0:i--0:xxii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.0},
URN = {urn:nbn:de:0030-drops-112155},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{fernandezv_et_al:LIPIcs.APPROX-RANDOM.2019.1,
author = {Fern\'{a}ndez V, Manuel and Woodruff, David P. and Yasuda, Taisuke},
title = {{The Query Complexity of Mastermind with l\underlinep Distances}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {1:1--1:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.1},
URN = {urn:nbn:de:0030-drops-112165},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.1},
annote = {Keywords: Mastermind, Query Complexity, l\underlinep Distance}
}
@InProceedings{chou_et_al:LIPIcs.APPROX-RANDOM.2019.2,
author = {Chou, Chi-Ning and Lei, Zhixian and Nakkiran, Preetum},
title = {{Tracking the l\underline2 Norm with Constant Update Time}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {2:1--2:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.2},
URN = {urn:nbn:de:0030-drops-112175},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.2},
annote = {Keywords: Streaming algorithms, Sketching algorithms, Tracking, CountSketch}
}
@InProceedings{moseley_et_al:LIPIcs.APPROX-RANDOM.2019.3,
author = {Moseley, Benjamin and Sviridenko, Maxim},
title = {{Submodular Optimization with Contention Resolution Extensions}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {3:1--3:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.3},
URN = {urn:nbn:de:0030-drops-112188},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.3},
annote = {Keywords: Submodular, Optimization, Approximation Algorithm, Interval Scheduling}
}
@InProceedings{hershkowitz_et_al:LIPIcs.APPROX-RANDOM.2019.4,
author = {Hershkowitz, David Ellis and Ravi, R. and Singla, Sahil},
title = {{Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {4:1--4:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.4},
URN = {urn:nbn:de:0030-drops-112196},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.4},
annote = {Keywords: Approximation Algorithms, Optimization Under Uncertainty, Two-Stage Optimization, Expected Max}
}
@InProceedings{guruswami_et_al:LIPIcs.APPROX-RANDOM.2019.5,
author = {Guruswami, Venkatesan and Tao, Runzhou},
title = {{Streaming Hardness of Unique Games}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {5:1--5:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.5},
URN = {urn:nbn:de:0030-drops-112209},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.5},
annote = {Keywords: Communication complexity, CSP, Fourier Analysis, Lower bounds, Streaming algorithms, Unique Games}
}
@InProceedings{filtser:LIPIcs.APPROX-RANDOM.2019.6,
author = {Filtser, Arnold},
title = {{On Strong Diameter Padded Decompositions}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {6:1--6:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.6},
URN = {urn:nbn:de:0030-drops-112217},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.6},
annote = {Keywords: Padded decomposition, Strong Diameter, Sparse Cover, Doubling Dimension, Minor free graphs, Unique Games, Spanners, Distance Oracles}
}
@InProceedings{eden_et_al:LIPIcs.APPROX-RANDOM.2019.7,
author = {Eden, Alon and Feige, Uriel and Feldman, Michal},
title = {{Max-Min Greedy Matching}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {7:1--7:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.7},
URN = {urn:nbn:de:0030-drops-112229},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.7},
annote = {Keywords: Online matching, Pricing mechanism, Markets}
}
@InProceedings{miller_et_al:LIPIcs.APPROX-RANDOM.2019.8,
author = {Miller, Gary L. and Walkington, Noel J. and Wang, Alex L.},
title = {{Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {8:1--8:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.8},
URN = {urn:nbn:de:0030-drops-112236},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.8},
annote = {Keywords: Hardy, Muckenhoupt, Laplacian, eigenvalue, effective resistance}
}
@InProceedings{harsha_et_al:LIPIcs.APPROX-RANDOM.2019.9,
author = {Harsha, Prahladh and Khot, Subhash and Lee, Euiwoong and Thiruvenkatachari, Devanathan},
title = {{Improved 3LIN Hardness via Linear Label Cover}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {9:1--9:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.9},
URN = {urn:nbn:de:0030-drops-112245},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.9},
annote = {Keywords: probabilistically checkable proofs, PCP, composition, 3LIN, low soundness error}
}
@InProceedings{cohen_et_al:LIPIcs.APPROX-RANDOM.2019.10,
author = {Cohen, Ilan Reuven and Eden, Alon and Fiat, Amos and Je\.{z}, {\L}ukasz},
title = {{Dynamic Pricing of Servers on Trees}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {10:1--10:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.10},
URN = {urn:nbn:de:0030-drops-112252},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.10},
annote = {Keywords: Online algorithms, Online mechanisms, k-server problem, Online pricing}
}
@InProceedings{chlamtac_et_al:LIPIcs.APPROX-RANDOM.2019.11,
author = {Chlamt\'{a}\v{c}, Eden and Dinitz, Michael and Robinson, Thomas},
title = {{Approximating the Norms of Graph Spanners}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {11:1--11:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.11},
URN = {urn:nbn:de:0030-drops-112261},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.11},
annote = {Keywords: Spanners, Approximations}
}
@InProceedings{rohatgi:LIPIcs.APPROX-RANDOM.2019.12,
author = {Rohatgi, Dhruv},
title = {{Conditional Hardness of Earth Mover Distance}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.12},
URN = {urn:nbn:de:0030-drops-112270},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.12},
annote = {Keywords: Earth Mover Distance, Hardness of Approximation, Fine-Grained Complexity}
}
@InProceedings{hulett:LIPIcs.APPROX-RANDOM.2019.13,
author = {Hulett, Reyna},
title = {{Single-Elimination Brackets Fail to Approximate Copeland Winner}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {13:1--13:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.13},
URN = {urn:nbn:de:0030-drops-112283},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.13},
annote = {Keywords: Voting theory, mechanism design, query complexity, approximation}
}
@InProceedings{carpenter_et_al:LIPIcs.APPROX-RANDOM.2019.14,
author = {Carpenter, Timothy and Salmasi, Ario and Sidiropoulos, Anastasios},
title = {{Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {14:1--14:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.14},
URN = {urn:nbn:de:0030-drops-112290},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.14},
annote = {Keywords: Routing, Node-disjoint, Symmetric demands, Minor-free graphs}
}
@InProceedings{guruswami_et_al:LIPIcs.APPROX-RANDOM.2019.15,
author = {Guruswami, Venkatesan and Sandeep, Sai},
title = {{Rainbow Coloring Hardness via Low Sensitivity Polymorphisms}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {15:1--15:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.15},
URN = {urn:nbn:de:0030-drops-112303},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.15},
annote = {Keywords: inapproximability, hardness of approximation, constraint satisfaction, hypergraph coloring, polymorphisms}
}
@InProceedings{allender_et_al:LIPIcs.APPROX-RANDOM.2019.16,
author = {Allender, Eric and Farach-Colton, Mart{\'\i}n and Tsai, Meng-Tsung},
title = {{Syntactic Separation of Subset Satisfiability Problems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {16:1--16:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.16},
URN = {urn:nbn:de:0030-drops-112319},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.16},
annote = {Keywords: Syntactic Class, Exponential Time Hypothesis, APX, PTAS}
}
@InProceedings{fotakis_et_al:LIPIcs.APPROX-RANDOM.2019.17,
author = {Fotakis, Dimitris and Matuschke, Jannik and Papadigenopoulos, Orestis},
title = {{Malleable Scheduling Beyond Identical Machines}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.17},
URN = {urn:nbn:de:0030-drops-112324},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.17},
annote = {Keywords: malleable, jobs, moldable, machines, unrelated, uniform, parallel, speeds, approximation, scheduling}
}
@InProceedings{bercea_et_al:LIPIcs.APPROX-RANDOM.2019.18,
author = {Bercea, Ioana O. and Gro{\ss}, Martin and Khuller, Samir and Kumar, Aounon and R\"{o}sner, Clemens and Schmidt, Daniel R. and Schmidt, Melanie},
title = {{On the Cost of Essentially Fair Clusterings}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {18:1--18:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.18},
URN = {urn:nbn:de:0030-drops-112337},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.18},
annote = {Keywords: approximation, clustering, fairness, LP rounding}
}
@InProceedings{kumar_et_al:LIPIcs.APPROX-RANDOM.2019.19,
author = {Kumar, Neeraj and Sintos, Stavros and Suri, Subhash},
title = {{The Maximum Exposure Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {19:1--19:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.19},
URN = {urn:nbn:de:0030-drops-112344},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.19},
annote = {Keywords: max-exposure, PTAS, densest k-subgraphs, geometric constraint removal, Network resilience}
}
@InProceedings{kale:LIPIcs.APPROX-RANDOM.2019.20,
author = {Kale, Sagar},
title = {{Small Space Stream Summary for Matroid Center}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {20:1--20:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.20},
URN = {urn:nbn:de:0030-drops-112359},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.20},
annote = {Keywords: Streaming Algorithms, Matroids, Clustering}
}
@InProceedings{birx_et_al:LIPIcs.APPROX-RANDOM.2019.21,
author = {Birx, Alexander and Disser, Yann and Schewior, Kevin},
title = {{Improved Bounds for Open Online Dial-a-Ride on the Line}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {21:1--21:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.21},
URN = {urn:nbn:de:0030-drops-112367},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.21},
annote = {Keywords: dial-a-ride on the line, elevator problem, online algorithms, competitive analysis, smartstart, competitive ratio}
}
@InProceedings{albers_et_al:LIPIcs.APPROX-RANDOM.2019.22,
author = {Albers, Susanne and Khan, Arindam and Ladewig, Leon},
title = {{Improved Online Algorithms for Knapsack and GAP in the Random Order Model}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {22:1--22:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.22},
URN = {urn:nbn:de:0030-drops-112376},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.22},
annote = {Keywords: Online algorithms, knapsack problem, random order model}
}
@InProceedings{quanrud:LIPIcs.APPROX-RANDOM.2019.23,
author = {Quanrud, Kent},
title = {{Fast and Deterministic Approximations for k-Cut}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {23:1--23:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.23},
URN = {urn:nbn:de:0030-drops-112388},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.23},
annote = {Keywords: k-cut, multiplicative weight updates}
}
@InProceedings{austrin_et_al:LIPIcs.APPROX-RANDOM.2019.24,
author = {Austrin, Per and Stankovi\'{c}, Aleksa},
title = {{Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {24:1--24:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.24},
URN = {urn:nbn:de:0030-drops-112394},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.24},
annote = {Keywords: Constraint satisfaction problems, global cardinality constraints, semidefinite programming, inapproximability, Unique Games Conjecture, Max-Cut, Max-2-Sat}
}
@InProceedings{schulz_et_al:LIPIcs.APPROX-RANDOM.2019.25,
author = {Schulz, Andreas S. and Udwani, Rajan},
title = {{Robust Appointment Scheduling with Heterogeneous Costs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {25:1--25:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.25},
URN = {urn:nbn:de:0030-drops-112407},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.25},
annote = {Keywords: Appointment scheduling, approximation algorithms, robust optimization}
}
@InProceedings{golovnev_et_al:LIPIcs.APPROX-RANDOM.2019.26,
author = {Golovnev, Alexander and Kulikov, Alexander S. and Logunov, Alexander and Mihajlin, Ivan and Nikolaev, Maksim},
title = {{Collapsing Superstring Conjecture}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {26:1--26:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.26},
URN = {urn:nbn:de:0030-drops-112411},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.26},
annote = {Keywords: superstring, shortest common superstring, approximation, greedy algorithms, greedy conjecture}
}
@InProceedings{braverman_et_al:LIPIcs.APPROX-RANDOM.2019.27,
author = {Braverman, Vladimir and Lang, Harry and Ullah, Enayat and Zhou, Samson},
title = {{Improved Algorithms for Time Decay Streams}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {27:1--27:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.27},
URN = {urn:nbn:de:0030-drops-112429},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.27},
annote = {Keywords: Streaming algorithms, approximation algorithms, facility location and clustering}
}
@InProceedings{ghoshal_et_al:LIPIcs.APPROX-RANDOM.2019.28,
author = {Ghoshal, Suprovat and Louis, Anand and Raychaudhury, Rahul},
title = {{Approximation Algorithms for Partially Colorable Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {28:1--28:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.28},
URN = {urn:nbn:de:0030-drops-112438},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.28},
annote = {Keywords: Approximation Algorithms, Vertex Coloring, Semi-random Models}
}
@InProceedings{jayaram_et_al:LIPIcs.APPROX-RANDOM.2019.29,
author = {Jayaram, Rajesh and Woodruff, David P.},
title = {{Towards Optimal Moment Estimation in Streaming and Distributed Models}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {29:1--29:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.29},
URN = {urn:nbn:de:0030-drops-112443},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.29},
annote = {Keywords: Streaming, Sketching, Message Passing, Moment Estimation}
}
@InProceedings{bhaskar_et_al:LIPIcs.APPROX-RANDOM.2019.30,
author = {Bhaskar, Umang and Kumar, Gunjan},
title = {{The Complexity of Partial Function Extension for Coverage Functions}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {30:1--30:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.30},
URN = {urn:nbn:de:0030-drops-112457},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.30},
annote = {Keywords: Coverage Functions, PAC Learning, Approximation Algorithm, Partial Function Extension}
}
@InProceedings{gharibian_et_al:LIPIcs.APPROX-RANDOM.2019.31,
author = {Gharibian, Sevag and Parekh, Ojas},
title = {{Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {31:1--31:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.31},
URN = {urn:nbn:de:0030-drops-112463},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.31},
annote = {Keywords: Approximation algorithm, Max-Cut, local Hamiltonian, QMA-hard, Heisenberg model, product state}
}
@InProceedings{huang_et_al:LIPIcs.APPROX-RANDOM.2019.32,
author = {Huang, Chien-Chung and Mari, Mathieu and Mathieu, Claire and Mitchell, Joseph S. B. and Mustafa, Nabil H.},
title = {{Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {32:1--32:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.32},
URN = {urn:nbn:de:0030-drops-112471},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.32},
annote = {Keywords: approximation algorithm, submodular function optimisation, unit disk graph, connectivity constraint}
}
@InProceedings{devvrit_et_al:LIPIcs.APPROX-RANDOM.2019.33,
author = {Devvrit and Krishnaswamy, Ravishankar and Rajaraman, Nived},
title = {{Robust Correlation Clustering}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {33:1--33:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.33},
URN = {urn:nbn:de:0030-drops-112483},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.33},
annote = {Keywords: Correlation Clustering, Outlier Detection, Clustering, Approximation Algorithms}
}
@InProceedings{liao_et_al:LIPIcs.APPROX-RANDOM.2019.34,
author = {Liao, Chao and Lin, Jiabao and Lu, Pinyan and Mao, Zhenyu},
title = {{Counting Independent Sets and Colorings on Random Regular Bipartite Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {34:1--34:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.34},
URN = {urn:nbn:de:0030-drops-112498},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.34},
annote = {Keywords: Approximate counting, Polymer model, Hardcore model, Coloring, Random bipartite graphs}
}
@InProceedings{diaz_et_al:LIPIcs.APPROX-RANDOM.2019.35,
author = {Diaz, Josep and Golin, Mordecai},
title = {{The Expected Number of Maximal Points of the Convolution of Two 2-D Distributions}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {35:1--35:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.35},
URN = {urn:nbn:de:0030-drops-112501},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.35},
annote = {Keywords: maximal points, probabilistic geometry, perturbations, Minkowski sum}
}
@InProceedings{anastos_et_al:LIPIcs.APPROX-RANDOM.2019.36,
author = {Anastos, Michael and Frieze, Alan},
title = {{On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {36:1--36:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.36},
URN = {urn:nbn:de:0030-drops-112513},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.36},
annote = {Keywords: Random Graphs, Colorings, Ergodicity}
}
@InProceedings{fahrbach_et_al:LIPIcs.APPROX-RANDOM.2019.37,
author = {Fahrbach, Matthew and Randall, Dana},
title = {{Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered Phases}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {37:1--37:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.37},
URN = {urn:nbn:de:0030-drops-112523},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.37},
annote = {Keywords: Correlated random walk, Markov chain Monte Carlo, Six-vertex model}
}
@InProceedings{li_et_al:LIPIcs.APPROX-RANDOM.2019.38,
author = {Li, Ray and Wootters, Mary},
title = {{Lifted Multiplicity Codes and the Disjoint Repair Group Property}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {38:1--38:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.38},
URN = {urn:nbn:de:0030-drops-112539},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.38},
annote = {Keywords: Lifted codes, Multiplicity codes, Disjoint repair group property, PIR code, Coding theory}
}
@InProceedings{schoenebeck_et_al:LIPIcs.APPROX-RANDOM.2019.39,
author = {Schoenebeck, Grant and Tao, Biaoshuai and Yu, Fang-Yi},
title = {{Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {39:1--39:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.39},
URN = {urn:nbn:de:0030-drops-112542},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.39},
annote = {Keywords: Nonsubmodular Influence Maximization, Bootstrap Percolation, Stochastic Blockmodel}
}
@InProceedings{dinur_et_al:LIPIcs.APPROX-RANDOM.2019.40,
author = {Dinur, Irit and Golubev, Konstantin},
title = {{Direct Sum Testing: The General Case}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {40:1--40:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.40},
URN = {urn:nbn:de:0030-drops-112554},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.40},
annote = {Keywords: property testing, direct sum, tensor product}
}
@InProceedings{chen_et_al:LIPIcs.APPROX-RANDOM.2019.41,
author = {Chen, Zongchen and Galanis, Andreas and Goldberg, Leslie Ann and Perkins, Will and Stewart, James and Vigoda, Eric},
title = {{Fast Algorithms at Low Temperatures via Markov Chains}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {41:1--41:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.41},
URN = {urn:nbn:de:0030-drops-112560},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.41},
annote = {Keywords: Markov chains, approximate counting, Potts model, hard-core model, expander graphs}
}
@InProceedings{murtagh_et_al:LIPIcs.APPROX-RANDOM.2019.42,
author = {Murtagh, Jack and Reingold, Omer and Sidford, Aaron and Vadhan, Salil},
title = {{Deterministic Approximation of Random Walks in Small Space}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {42:1--42:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.42},
URN = {urn:nbn:de:0030-drops-112577},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.42},
annote = {Keywords: random walks, space complexity, derandomization, spectral approximation, expander graphs}
}
@InProceedings{benaroya_et_al:LIPIcs.APPROX-RANDOM.2019.43,
author = {Ben-Aroya, Avraham and Cohen, Gil and Doron, Dean and Ta-Shma, Amnon},
title = {{Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {43:1--43:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.43},
URN = {urn:nbn:de:0030-drops-112587},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.43},
annote = {Keywords: Condensers, Extractors, Resilient functions, Explicit constructions}
}
@InProceedings{ban_et_al:LIPIcs.APPROX-RANDOM.2019.44,
author = {Ban, Frank and Chen, Xi and Servedio, Rocco A. and Sinha, Sandip},
title = {{Efficient Average-Case Population Recovery in the Presence of Insertions and Deletions}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {44:1--44:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.44},
URN = {urn:nbn:de:0030-drops-112592},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.44},
annote = {Keywords: population recovery, deletion channel, trace reconstruction}
}
@InProceedings{servedio_et_al:LIPIcs.APPROX-RANDOM.2019.45,
author = {Servedio, Rocco A. and Tan, Li-Yang},
title = {{Improved Pseudorandom Generators from Pseudorandom Multi-Switching Lemmas}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {45:1--45:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.45},
URN = {urn:nbn:de:0030-drops-112605},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.45},
annote = {Keywords: pseudorandom generators, switching lemmas, circuit complexity, unconditional derandomization}
}
@InProceedings{spang_et_al:LIPIcs.APPROX-RANDOM.2019.46,
author = {Spang, Bruce and Wootters, Mary},
title = {{Unconstraining Graph-Constrained Group Testing}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {46:1--46:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.46},
URN = {urn:nbn:de:0030-drops-112615},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.46},
annote = {Keywords: Group testing, network tomography, random graphs}
}
@InProceedings{emiris_et_al:LIPIcs.APPROX-RANDOM.2019.47,
author = {Emiris, Ioannis Z. and Margonis, Vasilis and Psarros, Ioannis},
title = {{Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of l\underline1}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {47:1--47:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.47},
URN = {urn:nbn:de:0030-drops-112628},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.47},
annote = {Keywords: Approximate nearest neighbor, Manhattan metric, randomized embedding}
}
@InProceedings{efthymiou_et_al:LIPIcs.APPROX-RANDOM.2019.48,
author = {Efthymiou, Charilaos and Galanis, Andreas and Hayes, Thomas P. and \v{S}tefankovi\v{c}, Daniel and Vigoda, Eric},
title = {{Improved Strong Spatial Mixing for Colorings on Trees}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {48:1--48:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.48},
URN = {urn:nbn:de:0030-drops-112630},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.48},
annote = {Keywords: colorings, regular tree, spatial mixing, phase transitions}
}
@InProceedings{bradac_et_al:LIPIcs.APPROX-RANDOM.2019.49,
author = {Bradac, Domagoj and Singla, Sahil and Zuzic, Goran},
title = {{(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {49:1--49:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.49},
URN = {urn:nbn:de:0030-drops-112641},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.49},
annote = {Keywords: stochastic programming, adaptivity gaps, stochastic multi-value probing, submodular functions, k-extendible systems, adaptive strategy, matroid intersection}
}
@InProceedings{gotlib_et_al:LIPIcs.APPROX-RANDOM.2019.50,
author = {Gotlib, Roy and Kaufman, Tali},
title = {{Testing Odd Direct Sums Using High Dimensional Expanders}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {50:1--50:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.50},
URN = {urn:nbn:de:0030-drops-112651},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.50},
annote = {Keywords: High Dimensional Expanders, Property Testing, Direct Sum}
}
@InProceedings{goos_et_al:LIPIcs.APPROX-RANDOM.2019.51,
author = {G\"{o}\"{o}s, Mika and Watson, Thomas},
title = {{A Lower Bound for Sampling Disjoint Sets}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {51:1--51:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.51},
URN = {urn:nbn:de:0030-drops-112666},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.51},
annote = {Keywords: Communication complexity, set disjointness, sampling}
}
@InProceedings{rubinfeld_et_al:LIPIcs.APPROX-RANDOM.2019.52,
author = {Rubinfeld, Ronitt and Vasilyan, Arsen},
title = {{Approximating the Noise Sensitivity of a Monotone Boolean Function}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {52:1--52:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.52},
URN = {urn:nbn:de:0030-drops-112672},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.52},
annote = {Keywords: Monotone Boolean functions, noise sensitivity, influence}
}
@InProceedings{galhotra_et_al:LIPIcs.APPROX-RANDOM.2019.53,
author = {Galhotra, Sainyam and Mazumdar, Arya and Pal, Soumyabrata and Saha, Barna},
title = {{Connectivity of Random Annulus Graphs and the Geometric Block Model}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {53:1--53:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.53},
URN = {urn:nbn:de:0030-drops-112682},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.53},
annote = {Keywords: random graphs, geometric graphs, community detection, block model}
}
@InProceedings{cannon_et_al:LIPIcs.APPROX-RANDOM.2019.54,
author = {Cannon, Sarah and Daymude, Joshua J. and G\"{o}kmen, Cem and Randall, Dana and Richa, Andr\'{e}a W.},
title = {{A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {54:1--54:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.54},
URN = {urn:nbn:de:0030-drops-112696},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.54},
annote = {Keywords: Markov chains, Programmable matter, Cluster expansion}
}
@InProceedings{bun_et_al:LIPIcs.APPROX-RANDOM.2019.55,
author = {Bun, Mark and Thaler, Justin},
title = {{The Large-Error Approximate Degree of AC^0}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {55:1--55:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.55},
URN = {urn:nbn:de:0030-drops-112709},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.55},
annote = {Keywords: approximate degree, discrepancy, margin complexity, polynomial approximations, secret sharing, threshold circuits}
}
@InProceedings{golovnev_et_al:LIPIcs.APPROX-RANDOM.2019.56,
author = {Golovnev, Alexander and G\"{o}\"{o}s, Mika and Reichman, Daniel and Shinkar, Igor},
title = {{String Matching: Communication, Circuits, and Learning}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {56:1--56:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.56},
URN = {urn:nbn:de:0030-drops-112717},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.56},
annote = {Keywords: string matching, communication complexity, circuit complexity, PAC learning}
}
@InProceedings{arvind_et_al:LIPIcs.APPROX-RANDOM.2019.57,
author = {Arvind, V. and Chatterjee, Abhranil and Datta, Rajit and Mukhopadhyay, Partha},
title = {{Efficient Black-Box Identity Testing for Free Group Algebras}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {57:1--57:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.57},
URN = {urn:nbn:de:0030-drops-112723},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.57},
annote = {Keywords: Rational identity testing, Free group algebra, Noncommutative computation, Randomized algorithms}
}
@InProceedings{knierim_et_al:LIPIcs.APPROX-RANDOM.2019.58,
author = {Knierim, Charlotte and Lengler, Johannes and Pfister, Pascal and Schaller, Ulysse and Steger, Angelika},
title = {{The Maximum Label Propagation Algorithm on Sparse Random Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {58:1--58:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.58},
URN = {urn:nbn:de:0030-drops-112731},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.58},
annote = {Keywords: random graphs, distributed algorithms, label propagation algorithms, consensus, community detection}
}
@InProceedings{agrawal:LIPIcs.APPROX-RANDOM.2019.59,
author = {Agrawal, Rohit},
title = {{Samplers and Extractors for Unbounded Functions}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {59:1--59:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.59},
URN = {urn:nbn:de:0030-drops-112749},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.59},
annote = {Keywords: averaging samplers, subgaussian samplers, randomness extractors, Kullback-Leibler divergence}
}
@InProceedings{janson_et_al:LIPIcs.APPROX-RANDOM.2019.60,
author = {Janson, Svante and Sorkin, Gregory B.},
title = {{Successive Minimum Spanning Trees}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {60:1--60:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.60},
URN = {urn:nbn:de:0030-drops-112759},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.60},
annote = {Keywords: miminum spanning tree, second-cheapest structure, inhomogeneous random graph, optimization in random structures, discrete probability, multi-type branching process, functional fixed point, robust optimization, Kruskal’s algorithm}
}
@InProceedings{jagadeesan:LIPIcs.APPROX-RANDOM.2019.61,
author = {Jagadeesan, Meena},
title = {{Simple Analysis of Sparse, Sign-Consistent JL}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {61:1--61:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.61},
URN = {urn:nbn:de:0030-drops-112762},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.61},
annote = {Keywords: Dimensionality reduction, Random projections, Johnson-Lindenstrauss distribution, Hanson-Wright bound, Neuroscience-based constraints}
}
@InProceedings{braverman_et_al:LIPIcs.APPROX-RANDOM.2019.62,
author = {Braverman, Vladimir and Feldman, Dan and Lang, Harry and Rus, Daniela},
title = {{Streaming Coreset Constructions for M-Estimators}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {62:1--62:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.62},
URN = {urn:nbn:de:0030-drops-112778},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.62},
annote = {Keywords: Streaming, Clustering, Coresets}
}
@InProceedings{narayanan:LIPIcs.APPROX-RANDOM.2019.63,
author = {Narayanan, Shyam},
title = {{Pairwise Independent Random Walks Can Be Slightly Unbounded}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {63:1--63:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.63},
URN = {urn:nbn:de:0030-drops-112787},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.63},
annote = {Keywords: k-wise Independence, Random Walks, Moments, Chaining}
}
@InProceedings{chen_et_al:LIPIcs.APPROX-RANDOM.2019.64,
author = {Chen, Zongchen and Vempala, Santosh S.},
title = {{Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {64:1--64:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.64},
URN = {urn:nbn:de:0030-drops-112790},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.64},
annote = {Keywords: logconcave distribution, sampling, Hamiltonian Monte Carlo, spectral gap, strong convexity}
}
@InProceedings{beimel_et_al:LIPIcs.APPROX-RANDOM.2019.65,
author = {Beimel, Amos and Nissim, Kobbi and Zaheri, Mohammad},
title = {{Exploring Differential Obliviousness}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {65:1--65:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.65},
URN = {urn:nbn:de:0030-drops-112803},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.65},
annote = {Keywords: Differential Obliviousness, Differential Privacy, Oblivious RAM, Graph Property Testing}
}
@InProceedings{anastos_et_al:LIPIcs.APPROX-RANDOM.2019.66,
author = {Anastos, Michael and Michaeli, Peleg and Petti, Samantha},
title = {{Thresholds in Random Motif Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {66:1--66:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.66},
URN = {urn:nbn:de:0030-drops-112819},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.66},
annote = {Keywords: Random graph, Connectivity, Hamiltonicty, Small subgraphs}
}
@InProceedings{blanca_et_al:LIPIcs.APPROX-RANDOM.2019.67,
author = {Blanca, Antonio and Gheissari, Reza and Vigoda, Eric},
title = {{Random-Cluster Dynamics in Z^2: Rapid Mixing with General Boundary Conditions}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {67:1--67:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.67},
URN = {urn:nbn:de:0030-drops-112827},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.67},
annote = {Keywords: Markov chain, mixing time, random-cluster model, Glauber dynamics, spatial mixing}
}
@InProceedings{kopparty_et_al:LIPIcs.APPROX-RANDOM.2019.68,
author = {Kopparty, Swastik and Resch, Nicolas and Ron-Zewi, Noga and Saraf, Shubhangi and Silas, Shashwat},
title = {{On List Recovery of High-Rate Tensor Codes}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {68:1--68:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.68},
URN = {urn:nbn:de:0030-drops-112832},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.68},
annote = {Keywords: Coding theory, Tensor codes, List-decoding and recovery, Local codes}
}
@InProceedings{yaroslavtsev_et_al:LIPIcs.APPROX-RANDOM.2019.69,
author = {Yaroslavtsev, Grigory and Zhou, Samson},
title = {{Approximate F\underline2-Sketching of Valuation Functions}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {69:1--69:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.69},
URN = {urn:nbn:de:0030-drops-112848},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.69},
annote = {Keywords: Sublinear algorithms, linear sketches, approximation algorithms}
}
@InProceedings{chakrabarti_et_al:LIPIcs.APPROX-RANDOM.2019.70,
author = {Chakrabarti, Amit and Ghosh, Prantar},
title = {{Streaming Verification of Graph Computations via Graph Structure}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {70:1--70:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.70},
URN = {urn:nbn:de:0030-drops-112856},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.70},
annote = {Keywords: data streams, interactive proofs, Arthur-Merlin, graph algorithms}
}
@InProceedings{bogdanov_et_al:LIPIcs.APPROX-RANDOM.2019.71,
author = {Bogdanov, Andrej and Mande, Nikhil S. and Thaler, Justin and Williamson, Christopher},
title = {{Approximate Degree, Secret Sharing, and Concentration Phenomena}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {71:1--71:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.71},
URN = {urn:nbn:de:0030-drops-112869},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.71},
annote = {Keywords: approximate degree, dual polynomial, pseudorandomness, polynomial approximation, secret sharing}
}
@InProceedings{li_et_al:LIPIcs.APPROX-RANDOM.2019.72,
author = {Li, Fu and Zuckerman, David},
title = {{Improved Extractors for Recognizable and Algebraic Sources}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {72:1--72:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
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.2019.72},
URN = {urn:nbn:de:0030-drops-112873},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.72},
annote = {Keywords: Extractor, Pseudorandomness}
}
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