@Proceedings{megow_et_al:LIPIcs.APPROX/RANDOM.2023,
title = {{LIPIcs, Volume 275, APPROX/RANDOM 2023, Complete Volume}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {1--1304},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023},
URN = {urn:nbn:de:0030-drops-188246},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023},
annote = {Keywords: LIPIcs, Volume 275, APPROX/RANDOM 2023, Complete Volume}
}
@InProceedings{megow_et_al:LIPIcs.APPROX/RANDOM.2023.0,
author = {Megow, Nicole and Smith, Adam},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {0:i--0:xxiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.0},
URN = {urn:nbn:de:0030-drops-188254},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{abboud_et_al:LIPIcs.APPROX/RANDOM.2023.1,
author = {Abboud, Amir and Bateni, MohammadHossein and Cohen-Addad, Vincent and Karthik C. S. and Seddighin, Saeed},
title = {{On Complexity of 1-Center in Various Metrics}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {1:1--1:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.1},
URN = {urn:nbn:de:0030-drops-188260},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.1},
annote = {Keywords: Center, Clustering, Edit metric, Ulam metric, Hamming metric, Fine-grained Complexity, Approximation}
}
@InProceedings{munagala_et_al:LIPIcs.APPROX/RANDOM.2023.2,
author = {Munagala, Kamesh and Sankar, Govind S. and Taylor, Erin},
title = {{Probabilistic Metric Embedding via Metric Labeling}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {2:1--2:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.2},
URN = {urn:nbn:de:0030-drops-188279},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.2},
annote = {Keywords: Metric Embedding, Approximation Algorithms, Ultrametrics}
}
@InProceedings{chandrasekaran_et_al:LIPIcs.APPROX/RANDOM.2023.3,
author = {Chandrasekaran, Karthekeyan and Wang, Weihang},
title = {{Approximating Submodular k-Partition via Principal Partition Sequence}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {3:1--3:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.3},
URN = {urn:nbn:de:0030-drops-188284},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.3},
annote = {Keywords: Approximation algorithms}
}
@InProceedings{lau_et_al:LIPIcs.APPROX/RANDOM.2023.4,
author = {Lau, Lap Chi and Wang, Robert and Zhou, Hong},
title = {{Experimental Design for Any p-Norm}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {4:1--4:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.4},
URN = {urn:nbn:de:0030-drops-188292},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.4},
annote = {Keywords: Approximation Algorithm, Optimal Experimental Design, Randomized Local Search}
}
@InProceedings{karakostas_et_al:LIPIcs.APPROX/RANDOM.2023.5,
author = {Karakostas, George and Kolliopoulos, Stavros G.},
title = {{Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {5:1--5:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.5},
URN = {urn:nbn:de:0030-drops-188305},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.5},
annote = {Keywords: scheduling, maximum weighted throughput, unrelated machines, approximation algorithm, PTAS}
}
@InProceedings{monemizadeh:LIPIcs.APPROX/RANDOM.2023.6,
author = {Monemizadeh, Morteza},
title = {{Facility Location in the Sublinear Geometric Model}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {6:1--6:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.6},
URN = {urn:nbn:de:0030-drops-188315},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.6},
annote = {Keywords: Facility Location, Sublinear Geometric Model, Range Counting Queries}
}
@InProceedings{bajpai_et_al:LIPIcs.APPROX/RANDOM.2023.7,
author = {Bajpai, Tanvi and Chekuri, Chandra},
title = {{Bicriteria Approximation Algorithms for Priority Matroid Median}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {7:1--7:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.7},
URN = {urn:nbn:de:0030-drops-188328},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.7},
annote = {Keywords: k-median, fair clustering, matroid}
}
@InProceedings{grigorescu_et_al:LIPIcs.APPROX/RANDOM.2023.8,
author = {Grigorescu, Elena and Kumar, Nithish and Lin, Young-San},
title = {{Approximation Algorithms for Directed Weighted Spanners}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {8:1--8:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.8},
URN = {urn:nbn:de:0030-drops-188335},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.8},
annote = {Keywords: directed weighted spanners, linear programming, junction tree}
}
@InProceedings{lieskovsky_et_al:LIPIcs.APPROX/RANDOM.2023.9,
author = {Lieskovsk\'{y}, Matej and Sgall, Ji\v{r}{\'\i} and Feldmann, Andreas Emil},
title = {{Approximation Algorithms and Lower Bounds for Graph Burning}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.9},
URN = {urn:nbn:de:0030-drops-188345},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.9},
annote = {Keywords: Graph Algorithms, approximation Algorithms, randomized Algorithms}
}
@InProceedings{golovnev_et_al:LIPIcs.APPROX/RANDOM.2023.10,
author = {Golovnev, Alexander and Guo, Siyao and Peters, Spencer and Stephens-Davidowitz, Noah},
title = {{The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {10:1--10:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.10},
URN = {urn:nbn:de:0030-drops-188351},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.10},
annote = {Keywords: search-to-decision reductions, oracles, constraint satisfaction, traveling salesman, discrete optimization}
}
@InProceedings{chlamtac_et_al:LIPIcs.APPROX/RANDOM.2023.11,
author = {Chlamt\'{a}\v{c}, Eden and Makarychev, Yury and Vakilian, Ali},
title = {{Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {11:1--11:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.11},
URN = {urn:nbn:de:0030-drops-188366},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.11},
annote = {Keywords: Red-Blue Set Cover Problem, Circuit Minimum Monotone Satisfying Assignment (MMSA) Problem, LP Rounding}
}
@InProceedings{gupta_et_al:LIPIcs.APPROX/RANDOM.2023.12,
author = {Gupta, Anupam and Kumar, Amit and Panigrahi, Debmalya},
title = {{Efficient Algorithms and Hardness Results for the Weighted k-Server Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {12:1--12:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.12},
URN = {urn:nbn:de:0030-drops-188375},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.12},
annote = {Keywords: Online Algorithms, Weighted k-server, Integrality Gap, Hardness}
}
@InProceedings{friggstad_et_al:LIPIcs.APPROX/RANDOM.2023.13,
author = {Friggstad, Zachary and Mousavi, Ramin},
title = {{A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {13:1--13:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.13},
URN = {urn:nbn:de:0030-drops-188389},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.13},
annote = {Keywords: Directed Steiner tree, Combinatorial optimization, approximation algorithms}
}
@InProceedings{bansal_et_al:LIPIcs.APPROX/RANDOM.2023.14,
author = {Bansal, Ishan and Cheriyan, Joe and Grout, Logan and Ibrahimpur, Sharat},
title = {{Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {14:1--14:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.14},
URN = {urn:nbn:de:0030-drops-188396},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.14},
annote = {Keywords: Approximation algorithms, Capacitated network design, Network design, Parametrized algorithms, Steiner cycle problem, Steiner 2-edge connected subgraphs, Steiner 2-node connected subgraphs}
}
@InProceedings{singer:LIPIcs.APPROX/RANDOM.2023.15,
author = {Singer, Noah G.},
title = {{Oblivious Algorithms for the Max-kAND Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {15:1--15:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.15},
URN = {urn:nbn:de:0030-drops-188409},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.15},
annote = {Keywords: streaming algorithm, approximation algorithm, constraint satisfaction problem (CSP), factor-revealing linear program}
}
@InProceedings{hohne_et_al:LIPIcs.APPROX/RANDOM.2023.16,
author = {H\"{o}hne, Felix and van Stee, Rob},
title = {{A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {16:1--16:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.16},
URN = {urn:nbn:de:0030-drops-188417},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.16},
annote = {Keywords: bamboo garden trimming, approximation algorithms, scheduling}
}
@InProceedings{deryckere_et_al:LIPIcs.APPROX/RANDOM.2023.17,
author = {Deryckere, Lindsey and Umboh, Seeun William},
title = {{Online Matching with Set and Concave Delays}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {17:1--17:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.17},
URN = {urn:nbn:de:0030-drops-188423},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.17},
annote = {Keywords: online algorithms, matching, delay, non-clairvoyant}
}
@InProceedings{durr_et_al:LIPIcs.APPROX/RANDOM.2023.18,
author = {D\"{u}rr, Anita and El Maalouly, Nicolas and Wulf, Lasse},
title = {{An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {18:1--18:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.18},
URN = {urn:nbn:de:0030-drops-188436},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.18},
annote = {Keywords: Perfect Matching, Exact Matching, Red-Blue Matching, Approximation Algorithms, Bounded Color Matching}
}
@InProceedings{foos_et_al:LIPIcs.APPROX/RANDOM.2023.19,
author = {Foos, Josefine and Held, Stephan and Spitzley, Yannik Kyle Dustin},
title = {{Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {19:1--19:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.19},
URN = {urn:nbn:de:0030-drops-188443},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.19},
annote = {Keywords: cost-distance Steiner tree, approximation algorithm, uniform}
}
@InProceedings{kashaev_et_al:LIPIcs.APPROX/RANDOM.2023.20,
author = {Kashaev, Danish and Sch\"{a}fer, Guido},
title = {{Round and Bipartize for Vertex Cover Approximation}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {20:1--20:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.20},
URN = {urn:nbn:de:0030-drops-188459},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.20},
annote = {Keywords: Combinatorial optimization, approximation algorithms, rounding algorithms, beyond the worst-case analysis}
}
@InProceedings{ayyadevara_et_al:LIPIcs.APPROX/RANDOM.2023.21,
author = {Ayyadevara, Nikhil and Bansal, Nikhil and Prabhu, Milind},
title = {{On Minimizing Generalized Makespan on Unrelated Machines}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {21:1--21:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.21},
URN = {urn:nbn:de:0030-drops-188462},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.21},
annote = {Keywords: Hardness of Approximation, Generalized Makespan}
}
@InProceedings{doronarad_et_al:LIPIcs.APPROX/RANDOM.2023.22,
author = {Doron-Arad, Ilan and Kulik, Ariel and Shachnai, Hadas},
title = {{An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {22:1--22:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.22},
URN = {urn:nbn:de:0030-drops-188470},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.22},
annote = {Keywords: bin packing, partition-matroid, AFPTAS, LP-rounding}
}
@InProceedings{patton_et_al:LIPIcs.APPROX/RANDOM.2023.23,
author = {Patton, Kalen and Russo, Matteo and Singla, Sahil},
title = {{Submodular Norms with Applications To Online Facility Location and Stochastic Probing}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {23:1--23:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.23},
URN = {urn:nbn:de:0030-drops-188484},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.23},
annote = {Keywords: Submodularity, Monotone Norms, Online Facility Location, Stochastic Probing}
}
@InProceedings{chekuri_et_al:LIPIcs.APPROX/RANDOM.2023.24,
author = {Chekuri, Chandra and Quanrud, Kent},
title = {{Independent Sets in Elimination Graphs with a Submodular Objective}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {24:1--24:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.24},
URN = {urn:nbn:de:0030-drops-188490},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.24},
annote = {Keywords: elimination graphs, independent set, submodular maximization, primal-dual}
}
@InProceedings{mahabadi_et_al:LIPIcs.APPROX/RANDOM.2023.25,
author = {Mahabadi, Sepideh and Narayanan, Shyam},
title = {{Improved Diversity Maximization Algorithms for Matching and Pseudoforest}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {25:1--25:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.25},
URN = {urn:nbn:de:0030-drops-188503},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.25},
annote = {Keywords: diversity maximization, approximation algorithms, composable coresets}
}
@InProceedings{chawla_et_al:LIPIcs.APPROX/RANDOM.2023.26,
author = {Chawla, Shuchi and Gergatsouli, Evangelia and McMahan, Jeremy and Tzamos, Christos},
title = {{Approximating Pandora’s Box with Correlations}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {26:1--26:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.26},
URN = {urn:nbn:de:0030-drops-188519},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.26},
annote = {Keywords: Pandora’s Box, Min Sum Set Cover, stochastic optimization, approximation preserving reduction}
}
@InProceedings{deberg_et_al:LIPIcs.APPROX/RANDOM.2023.27,
author = {de Berg, Mark and Sadhukhan, Arpan and Spieksma, Frits},
title = {{Stable Approximation Algorithms for Dominating Set and Independent Set}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {27:1--27:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.27},
URN = {urn:nbn:de:0030-drops-188527},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.27},
annote = {Keywords: Dynamic algorithms, approximation algorithms, stability, dominating set, independent set}
}
@InProceedings{liu_et_al:LIPIcs.APPROX/RANDOM.2023.28,
author = {Liu, Quanquan C. and Ke, Yiduo and Khuller, Samir},
title = {{Scalable Auction Algorithms for Bipartite Maximum Matching Problems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {28:1--28:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.28},
URN = {urn:nbn:de:0030-drops-188537},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.28},
annote = {Keywords: auction algorithms, maximum weight bipartite matching, maximum b-matching, distributed blackboard model, parallel work-depth model, streaming model, massively parallel computation model}
}
@InProceedings{becker_et_al:LIPIcs.APPROX/RANDOM.2023.29,
author = {Becker, Ruben and Casteigts, Arnaud and Crescenzi, Pierluigi and Kodric, Bojana and Renken, Malte and Raskin, Michael and Zamaraev, Viktor},
title = {{Giant Components in Random Temporal Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {29:1--29:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.29},
URN = {urn:nbn:de:0030-drops-188542},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.29},
annote = {Keywords: random temporal graph, Erd\H{o}s–R\'{e}nyi random graph, sharp threshold, temporal connectivity, temporal connected component, edge-ordered graph}
}
@InProceedings{lengler_et_al:LIPIcs.APPROX/RANDOM.2023.30,
author = {Lengler, Johannes and Martinsson, Anders and Petrova, Kalina and Schnider, Patrick and Steiner, Raphael and Weber, Simon and Welzl, Emo},
title = {{On Connectivity in Random Graph Models with Limited Dependencies}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {30:1--30:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.30},
URN = {urn:nbn:de:0030-drops-188556},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.30},
annote = {Keywords: Random Graphs, Independence, Dependency, Connectivity, Threshold, Probabilistic Method}
}
@InProceedings{impagliazzo_et_al:LIPIcs.APPROX/RANDOM.2023.31,
author = {Impagliazzo, Russell and Kabanets, Valentine and Volkovich, Ilya},
title = {{Synergy Between Circuit Obfuscation and Circuit Minimization}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {31:1--31:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.31},
URN = {urn:nbn:de:0030-drops-188569},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.31},
annote = {Keywords: Minimal Circuit Size Problem (MCSP), Circuit Lower Bounds, Complexity Classes, Indistinguishability Obfuscation, Separation of Classes, Statistical Distance}
}
@InProceedings{gupta_et_al:LIPIcs.APPROX/RANDOM.2023.32,
author = {Gupta, Meghal and Zhang, Rachel Yun},
title = {{Interactive Error Correcting Codes: New Constructions and Impossibility Bounds}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {32:1--32:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.32},
URN = {urn:nbn:de:0030-drops-188576},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.32},
annote = {Keywords: Code, Interactive Protocol, Error Resilience}
}
@InProceedings{efthymiou_et_al:LIPIcs.APPROX/RANDOM.2023.33,
author = {Efthymiou, Charilaos and Hayes, Thomas P. and \v{S}tefankovi\v{c}, Daniel and Vigoda, Eric},
title = {{Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {33:1--33:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.33},
URN = {urn:nbn:de:0030-drops-188589},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.33},
annote = {Keywords: MCMC, Mixing Time, Independent Sets, Hard-Core Model, Approximate Counting Algorithms, Sampling Algorithms}
}
@InProceedings{bshouty:LIPIcs.APPROX/RANDOM.2023.34,
author = {Bshouty, Nader H.},
title = {{Superpolynomial Lower Bounds for Learning Monotone Classes}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {34:1--34:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.34},
URN = {urn:nbn:de:0030-drops-188594},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.34},
annote = {Keywords: PAC Learning, Monotone DNF, Monotone Decision Tree, Monotone Junta, Lower Bound}
}
@InProceedings{karayel:LIPIcs.APPROX/RANDOM.2023.35,
author = {Karayel, Emin},
title = {{An Embarrassingly Parallel Optimal-Space Cardinality Estimation Algorithm}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {35:1--35:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.35},
URN = {urn:nbn:de:0030-drops-188607},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.35},
annote = {Keywords: Distinct Elements, Distributed Algorithms, Randomized Algorithms, Expander Graphs, Derandomization, Sketching}
}
@InProceedings{filmus_et_al:LIPIcs.APPROX/RANDOM.2023.36,
author = {Filmus, Yuval and Leigh, Itai and Riazanov, Artur and Sokolov, Dmitry},
title = {{Sampling and Certifying Symmetric Functions}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {36:1--36:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.36},
URN = {urn:nbn:de:0030-drops-188611},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.36},
annote = {Keywords: sampling, lower bounds, robust sunflowers, decision trees, switching networks}
}
@InProceedings{bennett_et_al:LIPIcs.APPROX/RANDOM.2023.37,
author = {Bennett, Huck and Peikert, Chris},
title = {{Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {37:1--37:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.37},
URN = {urn:nbn:de:0030-drops-188622},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.37},
annote = {Keywords: Lattices, Shortest Vector Problem, Reed-Solomon codes, NP-hardness, derandomization}
}
@InProceedings{anand_et_al:LIPIcs.APPROX/RANDOM.2023.38,
author = {Anand, Konrad and G\"{o}bel, Andreas and Pappik, Marcus and Perkins, Will},
title = {{Perfect Sampling for Hard Spheres from Strong Spatial Mixing}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {38:1--38:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.38},
URN = {urn:nbn:de:0030-drops-188638},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.38},
annote = {Keywords: perfect sampling, hard-sphere model, Gibbs point processes}
}
@InProceedings{chen_et_al:LIPIcs.APPROX/RANDOM.2023.39,
author = {Chen, Xi and Jin, Yaonan and Randolph, Tim and Servedio, Rocco A.},
title = {{Subset Sum in Time 2^\{n/2\} / poly(n)}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {39:1--39:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.39},
URN = {urn:nbn:de:0030-drops-188641},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.39},
annote = {Keywords: Exact algorithms, subset sum, log shaving}
}
@InProceedings{abdolazimi_et_al:LIPIcs.APPROX/RANDOM.2023.40,
author = {Abdolazimi, Dorna and Lindberg, Kasper and Gharan, Shayan Oveis},
title = {{On Optimization and Counting of Non-Broken Bases of Matroids}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {40:1--40:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.40},
URN = {urn:nbn:de:0030-drops-188653},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.40},
annote = {Keywords: Complexity, Hardness, Optimization, Counting, Random walk, Local to Global, Matroids}
}
@InProceedings{amireddy_et_al:LIPIcs.APPROX/RANDOM.2023.41,
author = {Amireddy, Prashanth and Srinivasan, Srikanth and Sudan, Madhu},
title = {{Low-Degree Testing over Grids}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {41:1--41:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.41},
URN = {urn:nbn:de:0030-drops-188665},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.41},
annote = {Keywords: Property testing, Low-degree testing, Small-set expansion, Local testing}
}
@InProceedings{arviv_et_al:LIPIcs.APPROX/RANDOM.2023.42,
author = {Arviv, Rubi and Chung, Lily and Levi, Reut and Pyne, Edward},
title = {{Improved Local Computation Algorithms for Constructing Spanners}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {42:1--42:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.42},
URN = {urn:nbn:de:0030-drops-188671},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.42},
annote = {Keywords: Local Computation Algorithms, Spanners}
}
@InProceedings{bogdanov_et_al:LIPIcs.APPROX/RANDOM.2023.43,
author = {Bogdanov, Andrej and Cheung, Tsun Ming and Dinesh, Krishnamoorthy and Lui, John C. S.},
title = {{Classical Simulation of One-Query Quantum Distinguishers}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {43:1--43:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.43},
URN = {urn:nbn:de:0030-drops-188684},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.43},
annote = {Keywords: Query complexity, quantum algorithms, hypothesis testing, Grothendieck’s inequality}
}
@InProceedings{lee_et_al:LIPIcs.APPROX/RANDOM.2023.44,
author = {Lee, Chin Ho and Pyne, Edward and Vadhan, Salil},
title = {{On the Power of Regular and Permutation Branching Programs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {44:1--44:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.44},
URN = {urn:nbn:de:0030-drops-188698},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.44},
annote = {Keywords: Pseudorandomness, Branching Programs}
}
@InProceedings{braverman_et_al:LIPIcs.APPROX/RANDOM.2023.45,
author = {Braverman, Vladimir and Manning, Joel and Wu, Zhiwei Steven and Zhou, Samson},
title = {{Private Data Stream Analysis for Universal Symmetric Norm Estimation}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {45:1--45:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.45},
URN = {urn:nbn:de:0030-drops-188701},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.45},
annote = {Keywords: Differential privacy, norm estimation}
}
@InProceedings{gishboliner_et_al:LIPIcs.APPROX/RANDOM.2023.46,
author = {Gishboliner, Lior and Kushnir, Nick and Shapira, Asaf},
title = {{Testing Versus Estimation of Graph Properties, Revisited}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {46:1--46:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.46},
URN = {urn:nbn:de:0030-drops-188713},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.46},
annote = {Keywords: Testing, estimation, weak regularity, randomized algorithms, graph theory, Frieze-Kannan Regularity}
}
@InProceedings{cook_et_al:LIPIcs.APPROX/RANDOM.2023.47,
author = {Cook, Joshua and Rothblum, Ron D.},
title = {{Efficient Interactive Proofs for Non-Deterministic Bounded Space}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {47:1--47:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.47},
URN = {urn:nbn:de:0030-drops-188727},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.47},
annote = {Keywords: Interactive Proofs, Alternating Algorithms, AC0\lbrack2\rbrack, Doubly Efficient Proofs}
}
@InProceedings{bishnu_et_al:LIPIcs.APPROX/RANDOM.2023.48,
author = {Bishnu, Arijit and Ghosh, Arijit and Mishra, Gopinath},
title = {{On the Complexity of Triangle Counting Using Emptiness Queries}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {48:1--48:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.48},
URN = {urn:nbn:de:0030-drops-188739},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.48},
annote = {Keywords: Triangle Counting, Emptiness Queries, Bipartite Independent Set Query}
}
@InProceedings{gotlib_et_al:LIPIcs.APPROX/RANDOM.2023.49,
author = {Gotlib, Roy and Kaufman, Tali},
title = {{Fine Grained Analysis of High Dimensional Random Walks}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {49:1--49:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.49},
URN = {urn:nbn:de:0030-drops-188740},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.49},
annote = {Keywords: High Dimensional Expanders, High Dimensional Random Walks, Local Spectral Expansion, Local to Global, Trickling Down}
}
@InProceedings{guruswami_et_al:LIPIcs.APPROX/RANDOM.2023.50,
author = {Guruswami, Venkatesan and Li, Shilun},
title = {{A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {50:1--50:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.50},
URN = {urn:nbn:de:0030-drops-188751},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.50},
annote = {Keywords: Algebraic codes, Pseudorandomness, Explicit Construction, Wozencraft Ensemble, Sidon Sets}
}
@InProceedings{hecht_et_al:LIPIcs.APPROX/RANDOM.2023.51,
author = {Hecht, Yahli and Minzer, Dor and Safra, Muli},
title = {{NP-Hardness of Almost Coloring Almost 3-Colorable Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {51:1--51:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.51},
URN = {urn:nbn:de:0030-drops-188761},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.51},
annote = {Keywords: PCP, Hardness of approximation}
}
@InProceedings{kopparty_et_al:LIPIcs.APPROX/RANDOM.2023.52,
author = {Kopparty, Swastik and N, Vishvajeet},
title = {{Extracting Mergers and Projections of Partitions}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {52:1--52:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.52},
URN = {urn:nbn:de:0030-drops-188777},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.52},
annote = {Keywords: randomness extractors, randomness mergers, extracting mergers, partitions, projections of partitions, covers, projections of covers}
}
@InProceedings{blanca_et_al:LIPIcs.APPROX/RANDOM.2023.53,
author = {Blanca, Antonio and Zhang, Xusheng},
title = {{Rapid Mixing of Global Markov Chains via Spectral Independence: The Unbounded Degree Case}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {53:1--53:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.53},
URN = {urn:nbn:de:0030-drops-188789},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.53},
annote = {Keywords: Markov chains, Spectral Independence, Potts model, Mixing Time}
}
@InProceedings{cojaoghlan_et_al:LIPIcs.APPROX/RANDOM.2023.54,
author = {Coja-Oghlan, Amin and Gao, Jane and Hahn-Klimroth, Max and Lee, Joon and M\"{u}ller, Noela and Rolvien, Maurice},
title = {{The Full Rank Condition for Sparse Random Matrices}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {54:1--54:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.54},
URN = {urn:nbn:de:0030-drops-188792},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.54},
annote = {Keywords: random matrices, rank, finite fields, rationals}
}
@InProceedings{cook_et_al:LIPIcs.APPROX/RANDOM.2023.55,
author = {Cook, Joshua and Moshkovitz, Dana},
title = {{Tighter MA/1 Circuit Lower Bounds from Verifier Efficient PCPs for PSPACE}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {55:1--55:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.55},
URN = {urn:nbn:de:0030-drops-188805},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.55},
annote = {Keywords: MA, PCP, Circuit Complexity}
}
@InProceedings{allender_et_al:LIPIcs.APPROX/RANDOM.2023.56,
author = {Allender, Eric and Gray, Jacob and Mutreja, Saachi and Tirumala, Harsha and Wang, Pengxiang},
title = {{Robustness for Space-Bounded Statistical Zero Knowledge}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {56:1--56:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.56},
URN = {urn:nbn:de:0030-drops-188815},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.56},
annote = {Keywords: Interactive Proofs}
}
@InProceedings{assadi_et_al:LIPIcs.APPROX/RANDOM.2023.57,
author = {Assadi, Sepehr and Kapralov, Michael and Yu, Huacheng},
title = {{On Constructing Spanners from Random Gaussian Projections}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {57:1--57:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.57},
URN = {urn:nbn:de:0030-drops-188821},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.57},
annote = {Keywords: sketching algorithm, lower bound, graph spanner}
}
@InProceedings{ashvinkumar_et_al:LIPIcs.APPROX/RANDOM.2023.58,
author = {Ashvinkumar, Vikrant and Assadi, Sepehr and Deng, Chengyuan and Gao, Jie and Wang, Chen},
title = {{Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {58:1--58:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.58},
URN = {urn:nbn:de:0030-drops-188830},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.58},
annote = {Keywords: Streaming algorithms, structural balance, pseudo-randomness generator}
}
@InProceedings{blocki_et_al:LIPIcs.APPROX/RANDOM.2023.59,
author = {Blocki, Jeremiah and Grigorescu, Elena and Mukherjee, Tamalika and Zhou, Samson},
title = {{How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {59:1--59:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.59},
URN = {urn:nbn:de:0030-drops-188849},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.59},
annote = {Keywords: Differential privacy, approximation algorithms}
}
@InProceedings{jeronimo:LIPIcs.APPROX/RANDOM.2023.60,
author = {Jeronimo, Fernando Granha},
title = {{Fast Decoding of Explicit Almost Optimal \epsilon-Balanced q-Ary Codes And Fast Approximation of Expanding k-CSPs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {60:1--60:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.60},
URN = {urn:nbn:de:0030-drops-188858},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.60},
annote = {Keywords: Decoding, Approximation, GV bound, CSPs, HDXs, Regularity}
}
@InProceedings{ferreirapintojr.:LIPIcs.APPROX/RANDOM.2023.61,
author = {Ferreira Pinto Jr., Renato},
title = {{Directed Poincar\'{e} Inequalities and L¹ Monotonicity Testing of Lipschitz Functions}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {61:1--61:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.61},
URN = {urn:nbn:de:0030-drops-188867},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.61},
annote = {Keywords: Monotonicity testing, property testing, isoperimetric inequalities, Poincar\'{e} inequalities}
}
@InProceedings{eden_et_al:LIPIcs.APPROX/RANDOM.2023.62,
author = {Eden, Talya and Houen, Jakob B{\ae}k Tejs and Narayanan, Shyam and Rosenbaum, Will and T\v{e}tek, Jakub},
title = {{Bias Reduction for Sum Estimation}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {62:1--62:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.62},
URN = {urn:nbn:de:0030-drops-188872},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.62},
annote = {Keywords: bias reduction, sum estimation, sublinear time algorithms, sample complexity}
}
@InProceedings{chakraborty_et_al:LIPIcs.APPROX/RANDOM.2023.63,
author = {Chakraborty, Sourav and Kayal, Chandrima and Mittal, Rajat and Paraashar, Manaswi and Sanyal, Swagato and Saurabh, Nitin},
title = {{On the Composition of Randomized Query Complexity and Approximate Degree}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {63:1--63:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.63},
URN = {urn:nbn:de:0030-drops-188883},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.63},
annote = {Keywords: Approximate degree, Boolean functions, Composition Theorem, Partial functions, Randomized Query Complexity}
}
@InProceedings{galanis_et_al:LIPIcs.APPROX/RANDOM.2023.64,
author = {Galanis, Andreas and Goldberg, Leslie Ann and Smolarova, Paulina},
title = {{Sampling from the Random Cluster Model on Random Regular Graphs at All Temperatures via Glauber Dynamics}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {64:1--64:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.64},
URN = {urn:nbn:de:0030-drops-188896},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.64},
annote = {Keywords: approximate counting, Glauber dynamics, random cluster model, approximate sampling, random regular graphs}
}
@InProceedings{gajulapalli_et_al:LIPIcs.APPROX/RANDOM.2023.65,
author = {Gajulapalli, Karthik and Golovnev, Alexander and Nagargoje, Satyajeet and Saraogi, Sidhant},
title = {{Range Avoidance for Constant Depth Circuits: Hardness and Algorithms}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {65:1--65:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.65},
URN = {urn:nbn:de:0030-drops-188901},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.65},
annote = {Keywords: Boolean function analysis, Explicit Constructions, Low-depth Circuits, Range Avoidance, Matrix Rigidity, Circuit Lower Bounds}
}
@InProceedings{berman_et_al:LIPIcs.APPROX/RANDOM.2023.66,
author = {Berman, Piotr and Murzabulatov, Meiram and Raskhodnikova, Sofya and Ristache, Dragos},
title = {{Testing Connectedness of Images}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {66:1--66:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.66},
URN = {urn:nbn:de:0030-drops-188918},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.66},
annote = {Keywords: Property testing, sublinear-algorithms, lower bounds, connectivity, graphs}
}
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