@Proceedings{byrka_et_al:LIPIcs.APPROX/RANDOM.2020,
title = {{LIPIcs, Volume 176, APPROX/RANDOM 2020, Complete Volume}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {1--1228},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020},
URN = {urn:nbn:de:0030-drops-126021},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020},
annote = {Keywords: LIPIcs, Volume 176, APPROX/RANDOM 2020, Complete Volume}
}
@InProceedings{byrka_et_al:LIPIcs.APPROX/RANDOM.2020.0,
author = {Byrka, Jaros{\l}aw and Meka, Raghu},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {0:i--0:xx},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.0},
URN = {urn:nbn:de:0030-drops-126037},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{aggarwal_et_al:LIPIcs.APPROX/RANDOM.2020.1,
author = {Aggarwal, Divesh and Guo, Siyao and Obremski, Maciej and Ribeiro, Jo\~{a}o and Stephens-Davidowitz, Noah},
title = {{Extractor Lower Bounds, Revisited}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {1:1--1:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.1},
URN = {urn:nbn:de:0030-drops-126041},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.1},
annote = {Keywords: randomness extractors, lower bounds, explicit constructions}
}
@InProceedings{ahn:LIPIcs.APPROX/RANDOM.2020.2,
author = {Ahn, Kwangjun},
title = {{A Simpler Strong Refutation of Random k-XOR}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {2:1--2:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.2},
URN = {urn:nbn:de:0030-drops-126053},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.2},
annote = {Keywords: Strong refutation, Random k-XOR, Spectral method, Trace power method}
}
@InProceedings{miracle_et_al:LIPIcs.APPROX/RANDOM.2020.3,
author = {Miracle, Sarah and Streib, Amanda Pascoe and Streib, Noah},
title = {{Iterated Decomposition of Biased Permutations via New Bounds on the Spectral Gap of Markov Chains}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {3:1--3:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.3},
URN = {urn:nbn:de:0030-drops-126069},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.3},
annote = {Keywords: Markov chains, Permutations, Decomposition, Spectral Gap, Iterated Decomposition}
}
@InProceedings{guo_et_al:LIPIcs.APPROX/RANDOM.2020.4,
author = {Guo, Zeyu and Gurjar, Rohit},
title = {{Improved Explicit Hitting-Sets for ROABPs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {4:1--4:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.4},
URN = {urn:nbn:de:0030-drops-126076},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.4},
annote = {Keywords: polynomial identity testing, hitting-set, ROABP, arithmetic branching programs, derandomization}
}
@InProceedings{bshouty:LIPIcs.APPROX/RANDOM.2020.5,
author = {Bshouty, Nader H.},
title = {{Almost Optimal Testers for Concise Representations}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {5:1--5:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.5},
URN = {urn:nbn:de:0030-drops-126087},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.5},
annote = {Keywords: Property Testing, Boolean function, Junta}
}
@InProceedings{alon_et_al:LIPIcs.APPROX/RANDOM.2020.6,
author = {Alon, Noga and Assadi, Sepehr},
title = {{Palette Sparsification Beyond (\Delta+1) Vertex Coloring}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {6:1--6:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.6},
URN = {urn:nbn:de:0030-drops-126096},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.6},
annote = {Keywords: Graph coloring, palette sparsification, sublinear algorithms, list-coloring}
}
@InProceedings{doron_et_al:LIPIcs.APPROX/RANDOM.2020.7,
author = {Doron, Dean and Ta-Shma, Amnon and Tell, Roei},
title = {{On Hitting-Set Generators for Polynomials That Vanish Rarely}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {7:1--7:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.7},
URN = {urn:nbn:de:0030-drops-126109},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.7},
annote = {Keywords: Hitting-set generators, Polynomials over finite fields, Quantified derandomization}
}
@InProceedings{blaser_et_al:LIPIcs.APPROX/RANDOM.2020.8,
author = {Bl\"{a}ser, Markus and Pandey, Anurag},
title = {{Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {8:1--8:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.8},
URN = {urn:nbn:de:0030-drops-126112},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.8},
annote = {Keywords: Algebraic Complexity theory, Polynomial Identity Testing, Hitting Set, Pseudorandomness}
}
@InProceedings{guruswami_et_al:LIPIcs.APPROX/RANDOM.2020.9,
author = {Guruswami, Venkatesan and Li, Ray and Mosheiff, Jonathan and Resch, Nicolas and Silas, Shashwat and Wootters, Mary},
title = {{Bounds for List-Decoding and List-Recovery of Random Linear Codes}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {9:1--9:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.9},
URN = {urn:nbn:de:0030-drops-126126},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.9},
annote = {Keywords: list-decoding, list-recovery, random linear codes, coding theory}
}
@InProceedings{shaltiel:LIPIcs.APPROX/RANDOM.2020.10,
author = {Shaltiel, Ronen},
title = {{Is It Possible to Improve Yao’s XOR Lemma Using Reductions That Exploit the Efficiency of Their Oracle?}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {10:1--10:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.10},
URN = {urn:nbn:de:0030-drops-126138},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.10},
annote = {Keywords: Yao’s XOR lemma, Hardness amplification, black-box reductions}
}
@InProceedings{greenhill_et_al:LIPIcs.APPROX/RANDOM.2020.11,
author = {Greenhill, Catherine and Mans, Bernard and Pourmiri, Ali},
title = {{Balanced Allocation on Dynamic Hypergraphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {11:1--11:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.11},
URN = {urn:nbn:de:0030-drops-126149},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.11},
annote = {Keywords: balls-into-bins, balanced allocation, power of two choices, witness tree technique}
}
@InProceedings{phillips_et_al:LIPIcs.APPROX/RANDOM.2020.12,
author = {Phillips, Jeff M. and Tai, Wai Ming},
title = {{The GaussianSketch for Almost Relative Error Kernel Distance}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {12:1--12:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.12},
URN = {urn:nbn:de:0030-drops-126150},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.12},
annote = {Keywords: Kernel Distance, Kernel Density Estimation, Sketching}
}
@InProceedings{price_et_al:LIPIcs.APPROX/RANDOM.2020.13,
author = {Price, Eric and Scarlett, Jonathan},
title = {{A Fast Binary Splitting Approach to Non-Adaptive Group Testing}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {13:1--13:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.13},
URN = {urn:nbn:de:0030-drops-126165},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.13},
annote = {Keywords: Group testing, sparsity, sublinear-time decoding, binary splitting}
}
@InProceedings{dreier_et_al:LIPIcs.APPROX/RANDOM.2020.14,
author = {Dreier, Jan and Kuinke, Philipp and Rossmanith, Peter},
title = {{Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {14:1--14:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.14},
URN = {urn:nbn:de:0030-drops-126171},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.14},
annote = {Keywords: Random Graphs, Preferential Attachment, Sparsity, Somewhere Dense}
}
@InProceedings{hirahara_et_al:LIPIcs.APPROX/RANDOM.2020.15,
author = {Hirahara, Shuichi and Watanabe, Osamu},
title = {{On Nonadaptive Security Reductions of Hitting Set Generators}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {15:1--15:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.15},
URN = {urn:nbn:de:0030-drops-126182},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.15},
annote = {Keywords: hitting set generator, black-box reduction, average-case complexity}
}
@InProceedings{czumaj_et_al:LIPIcs.APPROX/RANDOM.2020.16,
author = {Czumaj, Artur and Fichtenberger, Hendrik and Peng, Pan and Sohler, Christian},
title = {{Testable Properties in General Graphs and Random Order Streaming}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {16:1--16:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.16},
URN = {urn:nbn:de:0030-drops-126190},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.16},
annote = {Keywords: Graph property testing, sublinear algorithms, graph streaming algorithms}
}
@InProceedings{beideman_et_al:LIPIcs.APPROX/RANDOM.2020.17,
author = {Beideman, Calvin and Chandrasekaran, Karthekeyan and Xu, Chao},
title = {{Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {17:1--17:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.17},
URN = {urn:nbn:de:0030-drops-126203},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.17},
annote = {Keywords: Multiobjective Optimization, Hypergraph min-cut, Hypergraph-k-cut}
}
@InProceedings{blais_et_al:LIPIcs.APPROX/RANDOM.2020.18,
author = {Blais, Eric and Bommireddi, Abhinav},
title = {{On Testing and Robust Characterizations of Convexity}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {18:1--18:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.18},
URN = {urn:nbn:de:0030-drops-126214},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.18},
annote = {Keywords: Convexity, Line segment test, Convex hull test, Intersecting cones}
}
@InProceedings{levi_et_al:LIPIcs.APPROX/RANDOM.2020.19,
author = {Levi, Reut and Medina, Moti},
title = {{Distributed Testing of Graph Isomorphism in the CONGEST Model}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {19:1--19:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.19},
URN = {urn:nbn:de:0030-drops-126221},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.19},
annote = {Keywords: the CONGEST model, graph isomorphism, distributed property testing, distributed decision, graph algorithms}
}
@InProceedings{tran_et_al:LIPIcs.APPROX/RANDOM.2020.20,
author = {Tran, Linh and Vu, Van},
title = {{Reaching a Consensus on Random Networks: The Power of Few}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {20:1--20:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.20},
URN = {urn:nbn:de:0030-drops-126239},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.20},
annote = {Keywords: Random Graphs Majority Dynamics Consensus}
}
@InProceedings{garg_et_al:LIPIcs.APPROX/RANDOM.2020.21,
author = {Garg, Sumegha and Kothari, Pravesh K. and Raz, Ran},
title = {{Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich’s PRG}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {21:1--21:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.21},
URN = {urn:nbn:de:0030-drops-126248},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.21},
annote = {Keywords: memory-sample tradeoffs, bounded storage cryptography, Goldreich’s local PRG, distinguishing problems, refuting CSPs}
}
@InProceedings{chakrabarti_et_al:LIPIcs.APPROX/RANDOM.2020.22,
author = {Chakrabarti, Amit and Ghosh, Prantar and Thaler, Justin},
title = {{Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {22:1--22:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.22},
URN = {urn:nbn:de:0030-drops-126258},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.22},
annote = {Keywords: data streams, interactive proofs, Arthur-Merlin, graph algorithms}
}
@InProceedings{bhattacharya_et_al:LIPIcs.APPROX/RANDOM.2020.23,
author = {Bhattacharya, Anup and Chakraborty, Sourav and Ghosh, Arijit and Mishra, Gopinath and Paraashar, Manaswi},
title = {{Disjointness Through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {23:1--23:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.23},
URN = {urn:nbn:de:0030-drops-126261},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.23},
annote = {Keywords: Communication complexity, VC dimension, Sparsity, and Geometric Set System}
}
@InProceedings{canonne_et_al:LIPIcs.APPROX/RANDOM.2020.24,
author = {Canonne, Cl\'{e}ment L. and Wimmer, Karl},
title = {{Testing Data Binnings}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {24:1--24:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.24},
URN = {urn:nbn:de:0030-drops-126277},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.24},
annote = {Keywords: property testing, distribution testing, identity testing, hypothesis testing}
}
@InProceedings{kaufman_et_al:LIPIcs.APPROX/RANDOM.2020.25,
author = {Kaufman, Tali and Sharakanski, Ella},
title = {{Chernoff Bound for High-Dimensional Expanders}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {25:1--25:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.25},
URN = {urn:nbn:de:0030-drops-126287},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.25},
annote = {Keywords: High Dimensional Expanders, Random Walks, Tail Bounds}
}
@InProceedings{rashtchian_et_al:LIPIcs.APPROX/RANDOM.2020.26,
author = {Rashtchian, Cyrus and Woodruff, David P. and Zhu, Hanlin},
title = {{Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {26:1--26:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.26},
URN = {urn:nbn:de:0030-drops-126294},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.26},
annote = {Keywords: Query complexity, property testing, vector-matrix-vector, linear algebra, statistics, graph parameter estimation}
}
@InProceedings{ron_et_al:LIPIcs.APPROX/RANDOM.2020.27,
author = {Ron, Dana and Rosin, Asaf},
title = {{Almost Optimal Distribution-Free Sample-Based Testing of k-Modality}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {27:1--27:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.27},
URN = {urn:nbn:de:0030-drops-126307},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.27},
annote = {Keywords: Sample-based property testing, Distribution-free property testing, k-modality}
}
@InProceedings{bendavid_et_al:LIPIcs.APPROX/RANDOM.2020.28,
author = {Ben-David, Shalev and G\"{o}\"{o}s, Mika and Kothari, Robin and Watson, Thomas},
title = {{When Is Amplification Necessary for Composition in Randomized Query Complexity?}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {28:1--28:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.28},
URN = {urn:nbn:de:0030-drops-126316},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.28},
annote = {Keywords: Amplification, composition, query complexity}
}
@InProceedings{bhrushundi_et_al:LIPIcs.APPROX/RANDOM.2020.29,
author = {Bhrushundi, Abhishek and Harsha, Prahladh and Hatami, Pooya and Kopparty, Swastik and Kumar, Mrinal},
title = {{On Multilinear Forms: Bias, Correlation, and Tensor Rank}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {29:1--29:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.29},
URN = {urn:nbn:de:0030-drops-126325},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.29},
annote = {Keywords: polynomials, Boolean functions, tensor rank, bias, correlation}
}
@InProceedings{lund_et_al:LIPIcs.APPROX/RANDOM.2020.30,
author = {Lund, Ben and Potukuchi, Aditya},
title = {{On the List Recoverability of Randomly Punctured Codes}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {30:1--30:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.30},
URN = {urn:nbn:de:0030-drops-126330},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.30},
annote = {Keywords: List recovery, randomly punctured codes, Reed-Solomon codes}
}
@InProceedings{bandyapadhyay:LIPIcs.APPROX/RANDOM.2020.31,
author = {Bandyapadhyay, Sayan},
title = {{On Perturbation Resilience of Non-Uniform k-Center}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {31:1--31:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.31},
URN = {urn:nbn:de:0030-drops-126347},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.31},
annote = {Keywords: Non-Uniform k-center, stability, clustering, perturbation resilience}
}
@InProceedings{fomin_et_al:LIPIcs.APPROX/RANDOM.2020.32,
author = {Fomin, Fedor V. and Golovach, Petr A. and Panolan, Fahad and Simonov, Kirill},
title = {{Low-Rank Binary Matrix Approximation in Column-Sum Norm}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {32:1--32:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.32},
URN = {urn:nbn:de:0030-drops-126355},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.32},
annote = {Keywords: Binary Matrix Factorization, PTAS, Column-sum norm}
}
@InProceedings{chalermsook_et_al:LIPIcs.APPROX/RANDOM.2020.33,
author = {Chalermsook, Parinya and Chuzhoy, Julia and Saranurak, Thatchaphol},
title = {{Pinning down the Strong Wilber 1 Bound for Binary Search Trees}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {33:1--33:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.33},
URN = {urn:nbn:de:0030-drops-126368},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.33},
annote = {Keywords: Binary search trees, Dynamic optimality, Wilber bounds}
}
@InProceedings{guruswami_et_al:LIPIcs.APPROX/RANDOM.2020.34,
author = {Guruswami, Venkatesan and Opr\v{s}al, Jakub and Sandeep, Sai},
title = {{Revisiting Alphabet Reduction in Dinur’s PCP}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {34:1--34:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.34},
URN = {urn:nbn:de:0030-drops-126372},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.34},
annote = {Keywords: PCP theorem, CSP, discrete Fourier analysis, label cover, long code}
}
@InProceedings{starikovskaya_et_al:LIPIcs.APPROX/RANDOM.2020.35,
author = {Starikovskaya, Tatiana and Svagerka, Michal and Uzna\'{n}ski, Przemys{\l}aw},
title = {{L\underlinep Pattern Matching in a Stream}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {35:1--35:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.35},
URN = {urn:nbn:de:0030-drops-126381},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.35},
annote = {Keywords: streaming algorithms, approximate pattern matching}
}
@InProceedings{chubarian_et_al:LIPIcs.APPROX/RANDOM.2020.36,
author = {Chubarian, Karine and Sidiropoulos, Anastasios},
title = {{Computing Bi-Lipschitz Outlier Embeddings into the Line}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {36:1--36:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.36},
URN = {urn:nbn:de:0030-drops-126398},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.36},
annote = {Keywords: metric embeddings, outliers, distortion, approximation algorithms}
}
@InProceedings{megow_et_al:LIPIcs.APPROX/RANDOM.2020.37,
author = {Megow, Nicole and N\"{o}lke, Lukas},
title = {{Online Minimum Cost Matching with Recourse on the Line}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {37:1--37:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.37},
URN = {urn:nbn:de:0030-drops-126401},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.37},
annote = {Keywords: min-cost matching in bipartite graphs, recourse, competitive analysis, online}
}
@InProceedings{bhangale_et_al:LIPIcs.APPROX/RANDOM.2020.38,
author = {Bhangale, Amey and Chakraborty, Diptarka and Kumar, Rajendra},
title = {{Hardness of Approximation of (Multi-)LCS over Small Alphabet}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {38:1--38:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.38},
URN = {urn:nbn:de:0030-drops-126418},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.38},
annote = {Keywords: Longest common subsequence, Hardness of approximation, ETH-hardness, Densest k-subgraph problem}
}
@InProceedings{guo_et_al:LIPIcs.APPROX/RANDOM.2020.39,
author = {Guo, Xiangyu and Kortsarz, Guy and Laekhanukit, Bundit and Li, Shi and Vaz, Daniel and Xian, Jiayi},
title = {{On Approximating Degree-Bounded Network Design Problems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {39:1--39:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.39},
URN = {urn:nbn:de:0030-drops-126420},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.39},
annote = {Keywords: Directed Steiner Tree, Group Steiner Tree, degree-bounded}
}
@InProceedings{gupta_et_al:LIPIcs.APPROX/RANDOM.2020.40,
author = {Gupta, Varun and Krishnaswamy, Ravishankar and Sandeep, Sai},
title = {{Permutation Strikes Back: The Power of Recourse in Online Metric Matching}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {40:1--40:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.40},
URN = {urn:nbn:de:0030-drops-126431},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.40},
annote = {Keywords: online algorithms, bipartite matching}
}
@InProceedings{chlamtac_et_al:LIPIcs.APPROX/RANDOM.2020.41,
author = {Chlamt\'{a}\v{c}, Eden and Kolman, Petr},
title = {{How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {41:1--41:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.41},
URN = {urn:nbn:de:0030-drops-126446},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.41},
annote = {Keywords: Approximation Algorithms, Length Bounded Cuts, Cut-Flow Duality, Rounding of Linear Programms}
}
@InProceedings{guo_et_al:LIPIcs.APPROX/RANDOM.2020.42,
author = {Guo, Xiangyu and Kulkarni, Janardhan and Li, Shi and Xian, Jiayi},
title = {{On the Facility Location Problem in Online and Dynamic Models}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {42:1--42:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.42},
URN = {urn:nbn:de:0030-drops-126452},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.42},
annote = {Keywords: Facility location, online algorithm, recourse}
}
@InProceedings{agarwal_et_al:LIPIcs.APPROX/RANDOM.2020.43,
author = {Agarwal, Ishan and Regev, Oded and Tang, Yi},
title = {{Nearly Optimal Embeddings of Flat Tori}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {43:1--43:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.43},
URN = {urn:nbn:de:0030-drops-126464},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.43},
annote = {Keywords: Lattices, metric embeddings, flat torus}
}
@InProceedings{galvez_et_al:LIPIcs.APPROX/RANDOM.2020.44,
author = {G\'{a}lvez, Waldo and Grandoni, Fabrizio and Ameli, Afrouz Jabal and Jansen, Klaus and Khan, Arindam and Rau, Malin},
title = {{A Tight (3/2+\epsilon) Approximation for Skewed Strip Packing}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {44:1--44:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.44},
URN = {urn:nbn:de:0030-drops-126478},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.44},
annote = {Keywords: strip packing, approximation algorithm}
}
@InProceedings{fan_et_al:LIPIcs.APPROX/RANDOM.2020.45,
author = {Fan, Bohan and Ihara, Diego and Mohammadi, Neshat and Sgherzi, Francesco and Sidiropoulos, Anastasios and Valizadeh, Mina},
title = {{Learning Lines with Ordinal Constraints}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {45:1--45:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.45},
URN = {urn:nbn:de:0030-drops-126486},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.45},
annote = {Keywords: metric learning, embedding into the line, ordinal constraints, approximation algorithms}
}
@InProceedings{golan_et_al:LIPIcs.APPROX/RANDOM.2020.46,
author = {Golan, Shay and Kociumaka, Tomasz and Kopelowitz, Tsvi and Porat, Ely and Uzna\'{n}ski, Przemys{\l}aw},
title = {{Improved Circular k-Mismatch Sketches}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {46:1--46:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.46},
URN = {urn:nbn:de:0030-drops-126492},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.46},
annote = {Keywords: Hamming distance, k-mismatch, sketches, rotation, cyclic shift, communication complexity}
}
@InProceedings{khan_et_al:LIPIcs.APPROX/RANDOM.2020.47,
author = {Khan, Arindam and Pittu, Madhusudhan Reddy},
title = {{On Guillotine Separability of Squares and Rectangles}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {47:1--47:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.47},
URN = {urn:nbn:de:0030-drops-126505},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.47},
annote = {Keywords: Guillotine cuts, Rectangles, Squares, Packing, k-stage packing}
}
@InProceedings{benyamin_et_al:LIPIcs.APPROX/RANDOM.2020.48,
author = {Ben Yamin, Lior and Li, Jing and Sarpatwar, Kanthi and Schieber, Baruch and Shachnai, Hadas},
title = {{Maximizing Throughput in Flow Shop Real-Time Scheduling}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {48:1--48:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.48},
URN = {urn:nbn:de:0030-drops-126510},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.48},
annote = {Keywords: Flow shop, real-time scheduling, throughput maximization, approximation algorithms}
}
@InProceedings{katzelnick_et_al:LIPIcs.APPROX/RANDOM.2020.49,
author = {Katzelnick, Dor and Schwartz, Roy},
title = {{Maximizing the Correlation: Extending Grothendieck’s Inequality to Large Domains}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {49:1--49:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.49},
URN = {urn:nbn:de:0030-drops-126525},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.49},
annote = {Keywords: Correlation Clustering, Grothendieck’s Inequality, Approximation}
}
@InProceedings{andoni_et_al:LIPIcs.APPROX/RANDOM.2020.50,
author = {Andoni, Alexandr and Burns, Collin and Li, Yi and Mahabadi, Sepideh and Woodruff, David P.},
title = {{Streaming Complexity of SVMs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {50:1--50:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.50},
URN = {urn:nbn:de:0030-drops-126532},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.50},
annote = {Keywords: support vector machine, streaming algorithm, space lower bound, sketching algorithm, point estimation}
}
@InProceedings{gunda_et_al:LIPIcs.APPROX/RANDOM.2020.51,
author = {Gunda, Spoorthy and Jain, Pallavi and Lokshtanov, Daniel and Saurabh, Saket and Tale, Prafullkumar},
title = {{On the Parameterized Approximability of Contraction to Classes of Chordal Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {51:1--51:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.51},
URN = {urn:nbn:de:0030-drops-126545},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.51},
annote = {Keywords: Graph Contraction, FPT-Approximation, Inapproximability, Lossy Kernels}
}
@InProceedings{chybowskasokol_et_al:LIPIcs.APPROX/RANDOM.2020.52,
author = {Chybowska-Sok\'{o}{\l}, Joanna and Gutowski, Grzegorz and Junosza-Szaniawski, Konstanty and Mikos, Patryk and Polak, Adam},
title = {{Online Coloring of Short Intervals}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {52:1--52:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.52},
URN = {urn:nbn:de:0030-drops-126550},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.52},
annote = {Keywords: Online algorithms, graph coloring, interval graphs}
}
@InProceedings{schwartz_et_al:LIPIcs.APPROX/RANDOM.2020.53,
author = {Schwartz, Roy and Sharoni, Yotam},
title = {{Approximating Requirement Cut via a Configuration LP}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {53:1--53:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.53},
URN = {urn:nbn:de:0030-drops-126560},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.53},
annote = {Keywords: Approximation, Requirement Cut, Sparsest Cut, Metric Embedding}
}
@InProceedings{bubeck_et_al:LIPIcs.APPROX/RANDOM.2020.54,
author = {Bubeck, S\'{e}bastien and Rabani, Yuval},
title = {{Parametrized Metrical Task Systems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {54:1--54:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.54},
URN = {urn:nbn:de:0030-drops-126573},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.54},
annote = {Keywords: online computing, competitive analysis, metrical task systems}
}
@InProceedings{das_et_al:LIPIcs.APPROX/RANDOM.2020.55,
author = {Das, Syamantak and Jain, Lavina and Kumar, Nikhil},
title = {{A Constant Factor Approximation for Capacitated Min-Max Tree Cover}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {55:1--55:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.55},
URN = {urn:nbn:de:0030-drops-126581},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.55},
annote = {Keywords: Approximation Algorithms, Graph Algorithms, Min-Max Tree Cover, Vehicle Routing, Steiner Tree}
}
@InProceedings{anari_et_al:LIPIcs.APPROX/RANDOM.2020.56,
author = {Anari, Nima and Vuong, Thuy-Duong},
title = {{An Extension of Pl\"{u}cker Relations with Applications to Subdeterminant Maximization}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {56:1--56:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.56},
URN = {urn:nbn:de:0030-drops-126596},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.56},
annote = {Keywords: Pl\"{u}cker relations, determinant maximization, local search, exchange property, discrete concavity, discrepancy}
}
@InProceedings{gamlath_et_al:LIPIcs.APPROX/RANDOM.2020.57,
author = {Gamlath, Buddhima and Grinberg, Vadim},
title = {{Approximating Star Cover Problems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {57:1--57:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.57},
URN = {urn:nbn:de:0030-drops-126609},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.57},
annote = {Keywords: star cover, approximation algorithms, lp rounding}
}
@InProceedings{huang_et_al:LIPIcs.APPROX/RANDOM.2020.58,
author = {Huang, Neng and Potechin, Aaron},
title = {{On the Approximability of Presidential Type Predicates}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {58:1--58:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.58},
URN = {urn:nbn:de:0030-drops-126612},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.58},
annote = {Keywords: constraint satisfaction problems, approximation algorithms, presidential type predicates}
}
@InProceedings{hallgren_et_al:LIPIcs.APPROX/RANDOM.2020.59,
author = {Hallgren, Sean and Lee, Eunou and Parekh, Ojas},
title = {{An Approximation Algorithm for the MAX-2-Local Hamiltonian Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {59:1--59:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.59},
URN = {urn:nbn:de:0030-drops-126629},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.59},
annote = {Keywords: approximation algorithm, quantum computing, local Hamiltonian, mean-field theory, randomized rounding}
}
@InProceedings{wei:LIPIcs.APPROX/RANDOM.2020.60,
author = {Wei, Alexander},
title = {{Better and Simpler Learning-Augmented Online Caching}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {60:1--60:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.60},
URN = {urn:nbn:de:0030-drops-126633},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.60},
annote = {Keywords: Online caching, learning-augmented algorithms, beyond worst-case analysis}
}
@InProceedings{boyd_et_al:LIPIcs.APPROX/RANDOM.2020.61,
author = {Boyd, Sylvia and Cheriyan, Joseph and Cummings, Robert and Grout, Logan and Ibrahimpur, Sharat and Szigeti, Zolt\'{a}n and Wang, Lu},
title = {{A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {61:1--61:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.61},
URN = {urn:nbn:de:0030-drops-126643},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.61},
annote = {Keywords: 2-Edge Connectivity, Approximation Algorithms, Subtour LP for TSP}
}
@InProceedings{huang_et_al:LIPIcs.APPROX/RANDOM.2020.62,
author = {Huang, Chien-Chung and Thiery, Theophile and Ward, Justin},
title = {{Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {62:1--62:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.62},
URN = {urn:nbn:de:0030-drops-126657},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.62},
annote = {Keywords: submodular maximization, streaming algorithms, matroid, matchoid}
}
@InProceedings{chan_et_al:LIPIcs.APPROX/RANDOM.2020.63,
author = {Chan, Chun-Hsiang and Laekhanukit, Bundit and Wei, Hao-Ting and Zhang, Yuhao},
title = {{Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {63:1--63:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.63},
URN = {urn:nbn:de:0030-drops-126667},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.63},
annote = {Keywords: Approximation Algorithms, Network Design, Directed Graphs}
}
@InProceedings{bakshi_et_al:LIPIcs.APPROX/RANDOM.2020.64,
author = {Bakshi, Ainesh and Chepurko, Nadiia and Woodruff, David P.},
title = {{Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
pages = {64:1--64:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-164-1},
ISSN = {1868-8969},
year = {2020},
volume = {176},
editor = {Byrka, Jaros{\l}aw and Meka, Raghu},
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.2020.64},
URN = {urn:nbn:de:0030-drops-126679},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.64},
annote = {Keywords: Weighted Maximum Independent Set, Geometric Graphs, Turnstile Streams}
}
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