LIPIcs, Volume 317, APPROX/RANDOM 2024

• Amit Kumar and Noga Ron-Zewi LIPIcs, Volume 317, APPROX/RANDOM 2024, Complete Volume 10.4230/LIPIcs.APPROX/RANDOM.2024
• Amit Kumar and Noga Ron-Zewi Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.APPROX/RANDOM.2024.0
• Susanne Armbruster, Matthias Mnich, and Martin Nägele A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP 10.4230/LIPIcs.APPROX/RANDOM.2024.1
• Shuchi Chawla and Dimitris Christou Online Time-Windows TSP with Predictions 10.4230/LIPIcs.APPROX/RANDOM.2024.2
• Michael Dinitz, Guy Kortsarz, and Shi Li Degrees and Network Design: New Problems and Approximations 10.4230/LIPIcs.APPROX/RANDOM.2024.3
• Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, and Meirav Zehavi Hybrid k-Clustering: Blending k-Median and k-Center 10.4230/LIPIcs.APPROX/RANDOM.2024.4
• Divyarthi Mohan and Paweł Prałat Asynchronous Majority Dynamics on Binomial Random Graphs 10.4230/LIPIcs.APPROX/RANDOM.2024.5
• Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, and Meirav Zehavi Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3 10.4230/LIPIcs.APPROX/RANDOM.2024.6
• Johan Håstad, Björn Martinsson, Tamio-Vesa Nakajima, and Stanislav Živný A Logarithmic Approximation of Linearly-Ordered Colourings 10.4230/LIPIcs.APPROX/RANDOM.2024.7
• Josef Minařík and Jiří Sgall Speed-Robust Scheduling Revisited 10.4230/LIPIcs.APPROX/RANDOM.2024.8
• Karthekeyan Chandrasekaran, Chandra Chekuri, Manuel R. Torres, and Weihao Zhu On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms 10.4230/LIPIcs.APPROX/RANDOM.2024.9
• Martin Böhm, Matej Lieskovský, Sören Schmitt, Jiří Sgall, and Rob van Stee Improved Online Load Balancing with Known Makespan 10.4230/LIPIcs.APPROX/RANDOM.2024.10
• Björn Martinsson On the NP-Hardness Approximation Curve for Max-2Lin(2) 10.4230/LIPIcs.APPROX/RANDOM.2024.11
• Tomer Ezra, Stefano Leonardi, Michał Pawłowski, Matteo Russo, and Seeun William Umboh Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment 10.4230/LIPIcs.APPROX/RANDOM.2024.12
• Kshipra Bhawalkar, Zhe Feng, Anupam Gupta, Aranyak Mehta, David Wajc, and Di Wang The Average-Value Allocation Problem 10.4230/LIPIcs.APPROX/RANDOM.2024.13
• Moritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado, Kevin Schewior, and Andreas Wiese Scheduling on a Stochastic Number of Machines 10.4230/LIPIcs.APPROX/RANDOM.2024.14
• Yaron Fairstein, Joseph (Seffi) Naor, and Tomer Tsachor Distributional Online Weighted Paging with Limited Horizon 10.4230/LIPIcs.APPROX/RANDOM.2024.15
• Diba Hashemi and Weronika Wrzos-Kaminska Weighted Matching in the Random-Order Streaming and Robust Communication Models 10.4230/LIPIcs.APPROX/RANDOM.2024.16
• Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, and Amitabh Trehan Competitive Query Minimization for Stable Matching with One-Sided Uncertainty 10.4230/LIPIcs.APPROX/RANDOM.2024.17
• Hao Sun A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus 10.4230/LIPIcs.APPROX/RANDOM.2024.18
• Surendra Ghentiyala and Noah Stephens-Davidowitz More Basis Reduction for Linear Codes: Backward Reduction, BKZ, Slide Reduction, and More 10.4230/LIPIcs.APPROX/RANDOM.2024.19
• Benjamin Moseley, Heather Newman, and Kirk Pruhs Online k-Median with Consistent Clusters 10.4230/LIPIcs.APPROX/RANDOM.2024.20
• Daniel Hathcock, Guy Kortsarz, and R. Ravi The Telephone k-Multicast Problem 10.4230/LIPIcs.APPROX/RANDOM.2024.21
• Matthew Casey, Rajmohan Rajaraman, David Stalfa, and Cheng Tan Scheduling Splittable Jobs on Configurable Machines 10.4230/LIPIcs.APPROX/RANDOM.2024.22
• Mayank Goswami and Riko Jacob On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting 10.4230/LIPIcs.APPROX/RANDOM.2024.23
• Vladimir Braverman, Prathamesh Dharangutte, Vihan Shah, and Chen Wang Learning-Augmented Maximum Independent Set 10.4230/LIPIcs.APPROX/RANDOM.2024.24
• Philip Cervenjak, Junhao Gan, Seeun William Umboh, and Anthony Wirth Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound 10.4230/LIPIcs.APPROX/RANDOM.2024.25
• Mridul Nandi, N. V. Vinodchandran, Arijit Ghosh, Kuldeep S. Meel, Soumit Pal, and Sourav Chakraborty Improved Streaming Algorithm for the Klee’s Measure Problem and Generalizations 10.4230/LIPIcs.APPROX/RANDOM.2024.26
• Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding 10.4230/LIPIcs.APPROX/RANDOM.2024.27
• Pratik Ghosal, Syed Mohammad Meesum, and Katarzyna Paluch Rectangle Tiling Binary Arrays 10.4230/LIPIcs.APPROX/RANDOM.2024.28
• David Alemán Espinosa and Chaitanya Swamy Approximation Algorithms for Correlated Knapsack Orienteering 10.4230/LIPIcs.APPROX/RANDOM.2024.29
• Gabriel Arpino, Daniil Dmitriev, and Nicolo Grometto Greedy Heuristics and Linear Relaxations for the Random Hitting Set Problem 10.4230/LIPIcs.APPROX/RANDOM.2024.30
• Amnon Ta-Shma and Ron Zadicario The Expander Hitting Property When the Sets Are Arbitrarily Unbalanced 10.4230/LIPIcs.APPROX/RANDOM.2024.31
• Xiaoyu Chen, Heng Guo, Xinyuan Zhang, and Zongrui Zou Near-Linear Time Samplers for Matroid Independent Sets with Applications 10.4230/LIPIcs.APPROX/RANDOM.2024.32
• Ishaq Aden-Ali, Yanjun Han, Jelani Nelson, and Huacheng Yu On the Amortized Complexity of Approximate Counting 10.4230/LIPIcs.APPROX/RANDOM.2024.33
• Ashish Gola, Igor Shinkar, and Harsimran Singh Matrix Multiplication Reductions 10.4230/LIPIcs.APPROX/RANDOM.2024.34
• Ishay Haviv and Michal Parnas Testing Intersectingness of Uniform Families 10.4230/LIPIcs.APPROX/RANDOM.2024.35
• Lap Chi Lau and Dante Tjowasi On the Houdré-Tetali Conjecture About an Isoperimetric Constant of Graphs 10.4230/LIPIcs.APPROX/RANDOM.2024.36
• Hadley Black Nearly Optimal Bounds for Sample-Based Testing and Learning of k-Monotone Functions 10.4230/LIPIcs.APPROX/RANDOM.2024.37
• Nader H. Bshouty and George Haddad Approximating the Number of Relevant Variables in a Parity Implies Proper Learning 10.4230/LIPIcs.APPROX/RANDOM.2024.38
• Arnab Chatterjee, Amin Coja-Oghlan, Noela Müller, Connor Riddlesden, Maurice Rolvien, Pavel Zakharov, and Haodong Zhu The Number of Random 2-SAT Solutions Is Asymptotically Log-Normal 10.4230/LIPIcs.APPROX/RANDOM.2024.39
• Monika Henzinger, A. R. Sricharan, and Teresa Anna Steiner Private Counting of Distinct Elements in the Turnstile Model and Extensions 10.4230/LIPIcs.APPROX/RANDOM.2024.40
• Alexander Golovnev, Zeyu Guo, Pooya Hatami, Satyajeet Nagargoje, and Chao Yan Hilbert Functions and Low-Degree Randomness Extractors 10.4230/LIPIcs.APPROX/RANDOM.2024.41
• Huck Bennett, Karthik Gajulapalli, Alexander Golovnev, and Evelyn Warton Matrix Multiplication Verification Using Coding Theory 10.4230/LIPIcs.APPROX/RANDOM.2024.42
• Eden Fargion, Ran Gelles, and Meghal Gupta Interactive Coding with Unbounded Noise 10.4230/LIPIcs.APPROX/RANDOM.2024.43
• Ashish Dwivedi, Zeyu Guo, and Ben Lee Volk Optimal Pseudorandom Generators for Low-Degree Polynomials over Moderately Large Fields 10.4230/LIPIcs.APPROX/RANDOM.2024.44
• Tomer Adar and Eldar Fischer Refining the Adaptivity Notion in the Huge Object Model 10.4230/LIPIcs.APPROX/RANDOM.2024.45
• Tomer Adar, Eldar Fischer, and Amit Levi Support Testing in the Huge Object Model 10.4230/LIPIcs.APPROX/RANDOM.2024.46
• Evan Chang, Neel Kolhe, and Youngtak Sohn Upper Bounds on the 2-Colorability Threshold of Random d-Regular k-Uniform Hypergraphs for k ≥ 3 10.4230/LIPIcs.APPROX/RANDOM.2024.47
• Tomer Adar, Eldar Fischer, and Amit Levi Improved Bounds for High-Dimensional Equivalence and Product Testing Using Subcube Queries 10.4230/LIPIcs.APPROX/RANDOM.2024.48
• Holden Lee Parallelising Glauber Dynamics 10.4230/LIPIcs.APPROX/RANDOM.2024.49
• Natalia Dobrokhotova-Maikova, Alexander Kozachinskiy, and Vladimir Podolskii Towards Simpler Sorting Networks and Monotone Circuits for Majority 10.4230/LIPIcs.APPROX/RANDOM.2024.50
• Halley Goldberg and Valentine Kabanets Consequences of Randomized Reductions from SAT to Time-Bounded Kolmogorov Complexity 10.4230/LIPIcs.APPROX/RANDOM.2024.51
• Xi Chen, Anindya De, Chin Ho Lee, and Rocco A. Servedio Trace Reconstruction from Local Statistical Queries 10.4230/LIPIcs.APPROX/RANDOM.2024.52
• Dean Doron, Jonathan Mosheiff, and Mary Wootters When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound? 10.4230/LIPIcs.APPROX/RANDOM.2024.53
• Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, and Dor Minzer Parallel Repetition of k-Player Projection Games 10.4230/LIPIcs.APPROX/RANDOM.2024.54
• Praneeth Kacham and David P. Woodruff Faster Algorithms for Schatten-p Low Rank Approximation 10.4230/LIPIcs.APPROX/RANDOM.2024.55
• Aiya Kuchukova, Marcus Pappik, Will Perkins, and Corrine Yap Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs 10.4230/LIPIcs.APPROX/RANDOM.2024.56
• Uri Meir, Gregory Schwartzman, and Yuichi Yoshida Stochastic Distance in Property Testing 10.4230/LIPIcs.APPROX/RANDOM.2024.57
• Vedat Levi Alev and Shravas Rao Expanderizing Higher Order Random Walks 10.4230/LIPIcs.APPROX/RANDOM.2024.58
• Elad Aigner-Horev, Dan Hefetz, and Mathias Schacht Ramsey Properties of Randomly Perturbed Hypergraphs 10.4230/LIPIcs.APPROX/RANDOM.2024.59
• Reut Levi, Moti Medina, and Omer Tubul Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs 10.4230/LIPIcs.APPROX/RANDOM.2024.60
• Kuan Cheng, Minghui Ouyang, Chong Shangguan, and Yuanting Shen When Can an Expander Code Correct Ω(n) Errors in O(n) Time? 10.4230/LIPIcs.APPROX/RANDOM.2024.61
• Yotam Dikstein and Irit Dinur Coboundary and Cosystolic Expansion Without Dependence on Dimension or Degree 10.4230/LIPIcs.APPROX/RANDOM.2024.62
• Vishesh Jain and Clayton Mizgerd Rapid Mixing of the Down-Up Walk on Matchings of a Fixed Size 10.4230/LIPIcs.APPROX/RANDOM.2024.63
• Nikhil S. Mande, Manaswi Paraashar, Swagato Sanyal, and Nitin Saurabh On the Communication Complexity of Finding a King in a Tournament 10.4230/LIPIcs.APPROX/RANDOM.2024.64
• Venkatesan Guruswami and Hsin-Po Wang Capacity-Achieving Gray Codes 10.4230/LIPIcs.APPROX/RANDOM.2024.65
• Noam Mazor and Rafael Pass On Black-Box Meta Complexity and Function Inversion 10.4230/LIPIcs.APPROX/RANDOM.2024.66
• Nicholas Harvey and Arvin Sahami Explicit and Near-Optimal Construction of t-Rankwise Independent Permutations 10.4230/LIPIcs.APPROX/RANDOM.2024.67
• Inbar Ben Yaacov, Yotam Dikstein, and Gal Maor Sparse High Dimensional Expanders via Local Lifts 10.4230/LIPIcs.APPROX/RANDOM.2024.68
• Kuan Cheng and Ruiyang Wu Randomness Extractors in AC⁰ and NC¹: Optimal up to Constant Factors 10.4230/LIPIcs.APPROX/RANDOM.2024.69
• Andreas Galanis, Alkis Kalavasis, and Anthimos Vardis Kandiros On Sampling from Ising Models with Spectral Constraints 10.4230/LIPIcs.APPROX/RANDOM.2024.70
• Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, and Nitin Saurabh Approximate Degree Composition for Recursive Functions 10.4230/LIPIcs.APPROX/RANDOM.2024.71
• Tal Herman Public Coin Interactive Proofs for Label-Invariant Distribution Properties 10.4230/LIPIcs.APPROX/RANDOM.2024.72
• Jakub Tětek Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private 10.4230/LIPIcs.APPROX/RANDOM.2024.73
• Kostas Lakis, Johannes Lengler, Kalina Petrova, and Leon Schiller Improved Bounds for Graph Distances in Scale Free Percolation and Related Models 10.4230/LIPIcs.APPROX/RANDOM.2024.74
• Pranjal Dutta, Amit Sinhababu, and Thomas Thierauf Derandomizing Multivariate Polynomial Factoring for Low Degree Factors 10.4230/LIPIcs.APPROX/RANDOM.2024.75