LIPIcs, Volume 275, APPROX/RANDOM 2023

• Nicole Megow and Adam Smith LIPIcs, Volume 275, APPROX/RANDOM 2023, Complete Volume 10.4230/LIPIcs.APPROX/RANDOM.2023
• Nicole Megow and Adam Smith Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.APPROX/RANDOM.2023.0
• Amir Abboud, MohammadHossein Bateni, Vincent Cohen-Addad, Karthik C. S., and Saeed Seddighin On Complexity of 1-Center in Various Metrics 10.4230/LIPIcs.APPROX/RANDOM.2023.1
• Kamesh Munagala, Govind S. Sankar, and Erin Taylor Probabilistic Metric Embedding via Metric Labeling 10.4230/LIPIcs.APPROX/RANDOM.2023.2
• Karthekeyan Chandrasekaran and Weihang Wang Approximating Submodular k-Partition via Principal Partition Sequence 10.4230/LIPIcs.APPROX/RANDOM.2023.3
• Lap Chi Lau, Robert Wang, and Hong Zhou Experimental Design for Any p-Norm 10.4230/LIPIcs.APPROX/RANDOM.2023.4
• George Karakostas and Stavros G. Kolliopoulos Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines 10.4230/LIPIcs.APPROX/RANDOM.2023.5
• Morteza Monemizadeh Facility Location in the Sublinear Geometric Model 10.4230/LIPIcs.APPROX/RANDOM.2023.6
• Tanvi Bajpai and Chandra Chekuri Bicriteria Approximation Algorithms for Priority Matroid Median 10.4230/LIPIcs.APPROX/RANDOM.2023.7
• Elena Grigorescu, Nithish Kumar, and Young-San Lin Approximation Algorithms for Directed Weighted Spanners 10.4230/LIPIcs.APPROX/RANDOM.2023.8
• Matej Lieskovský, Jiří Sgall, and Andreas Emil Feldmann Approximation Algorithms and Lower Bounds for Graph Burning 10.4230/LIPIcs.APPROX/RANDOM.2023.9
• Alexander Golovnev, Siyao Guo, Spencer Peters, and Noah Stephens-Davidowitz The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems 10.4230/LIPIcs.APPROX/RANDOM.2023.10
• Eden Chlamtáč, Yury Makarychev, and Ali Vakilian Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment 10.4230/LIPIcs.APPROX/RANDOM.2023.11
• Anupam Gupta, Amit Kumar, and Debmalya Panigrahi Efficient Algorithms and Hardness Results for the Weighted k-Server Problem 10.4230/LIPIcs.APPROX/RANDOM.2023.12
• Zachary Friggstad and Ramin Mousavi A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs 10.4230/LIPIcs.APPROX/RANDOM.2023.13
• Ishan Bansal, Joe Cheriyan, Logan Grout, and Sharat Ibrahimpur Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals 10.4230/LIPIcs.APPROX/RANDOM.2023.14
• Noah G. Singer Oblivious Algorithms for the Max-kAND Problem 10.4230/LIPIcs.APPROX/RANDOM.2023.15
• Felix Höhne and Rob van Stee A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs 10.4230/LIPIcs.APPROX/RANDOM.2023.16
• Lindsey Deryckere and Seeun William Umboh Online Matching with Set and Concave Delays 10.4230/LIPIcs.APPROX/RANDOM.2023.17
• Anita Dürr, Nicolas El Maalouly, and Lasse Wulf An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs 10.4230/LIPIcs.APPROX/RANDOM.2023.18
• Josefine Foos, Stephan Held, and Yannik Kyle Dustin Spitzley Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem 10.4230/LIPIcs.APPROX/RANDOM.2023.19
• Danish Kashaev and Guido Schäfer Round and Bipartize for Vertex Cover Approximation 10.4230/LIPIcs.APPROX/RANDOM.2023.20
• Nikhil Ayyadevara, Nikhil Bansal, and Milind Prabhu On Minimizing Generalized Makespan on Unrelated Machines 10.4230/LIPIcs.APPROX/RANDOM.2023.21
• Ilan Doron-Arad, Ariel Kulik, and Hadas Shachnai An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding 10.4230/LIPIcs.APPROX/RANDOM.2023.22
• Kalen Patton, Matteo Russo, and Sahil Singla Submodular Norms with Applications To Online Facility Location and Stochastic Probing 10.4230/LIPIcs.APPROX/RANDOM.2023.23
• Chandra Chekuri and Kent Quanrud Independent Sets in Elimination Graphs with a Submodular Objective 10.4230/LIPIcs.APPROX/RANDOM.2023.24
• Sepideh Mahabadi and Shyam Narayanan Improved Diversity Maximization Algorithms for Matching and Pseudoforest 10.4230/LIPIcs.APPROX/RANDOM.2023.25
• Shuchi Chawla, Evangelia Gergatsouli, Jeremy McMahan, and Christos Tzamos Approximating Pandora’s Box with Correlations 10.4230/LIPIcs.APPROX/RANDOM.2023.26
• Mark de Berg, Arpan Sadhukhan, and Frits Spieksma Stable Approximation Algorithms for Dominating Set and Independent Set 10.4230/LIPIcs.APPROX/RANDOM.2023.27
• Quanquan C. Liu, Yiduo Ke, and Samir Khuller Scalable Auction Algorithms for Bipartite Maximum Matching Problems 10.4230/LIPIcs.APPROX/RANDOM.2023.28
• Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, and Viktor Zamaraev Giant Components in Random Temporal Graphs 10.4230/LIPIcs.APPROX/RANDOM.2023.29
• Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, and Emo Welzl On Connectivity in Random Graph Models with Limited Dependencies 10.4230/LIPIcs.APPROX/RANDOM.2023.30
• Russell Impagliazzo, Valentine Kabanets, and Ilya Volkovich Synergy Between Circuit Obfuscation and Circuit Minimization 10.4230/LIPIcs.APPROX/RANDOM.2023.31
• Meghal Gupta and Rachel Yun Zhang Interactive Error Correcting Codes: New Constructions and Impossibility Bounds 10.4230/LIPIcs.APPROX/RANDOM.2023.32
• Charilaos Efthymiou, Thomas P. Hayes, Daniel Štefankovič, and Eric Vigoda Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees 10.4230/LIPIcs.APPROX/RANDOM.2023.33
• Nader H. Bshouty Superpolynomial Lower Bounds for Learning Monotone Classes 10.4230/LIPIcs.APPROX/RANDOM.2023.34
• Emin Karayel An Embarrassingly Parallel Optimal-Space Cardinality Estimation Algorithm 10.4230/LIPIcs.APPROX/RANDOM.2023.35
• Yuval Filmus, Itai Leigh, Artur Riazanov, and Dmitry Sokolov Sampling and Certifying Symmetric Functions 10.4230/LIPIcs.APPROX/RANDOM.2023.36
• Huck Bennett and Chris Peikert Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes 10.4230/LIPIcs.APPROX/RANDOM.2023.37
• Konrad Anand, Andreas Göbel, Marcus Pappik, and Will Perkins Perfect Sampling for Hard Spheres from Strong Spatial Mixing 10.4230/LIPIcs.APPROX/RANDOM.2023.38
• Xi Chen, Yaonan Jin, Tim Randolph, and Rocco A. Servedio Subset Sum in Time 2^{n/2} / poly(n) 10.4230/LIPIcs.APPROX/RANDOM.2023.39
• Dorna Abdolazimi, Kasper Lindberg, and Shayan Oveis Gharan On Optimization and Counting of Non-Broken Bases of Matroids 10.4230/LIPIcs.APPROX/RANDOM.2023.40
• Prashanth Amireddy, Srikanth Srinivasan, and Madhu Sudan Low-Degree Testing over Grids 10.4230/LIPIcs.APPROX/RANDOM.2023.41
• Rubi Arviv, Lily Chung, Reut Levi, and Edward Pyne Improved Local Computation Algorithms for Constructing Spanners 10.4230/LIPIcs.APPROX/RANDOM.2023.42
• Andrej Bogdanov, Tsun Ming Cheung, Krishnamoorthy Dinesh, and John C. S. Lui Classical Simulation of One-Query Quantum Distinguishers 10.4230/LIPIcs.APPROX/RANDOM.2023.43
• Chin Ho Lee, Edward Pyne, and Salil Vadhan On the Power of Regular and Permutation Branching Programs 10.4230/LIPIcs.APPROX/RANDOM.2023.44
• Vladimir Braverman, Joel Manning, Zhiwei Steven Wu, and Samson Zhou Private Data Stream Analysis for Universal Symmetric Norm Estimation 10.4230/LIPIcs.APPROX/RANDOM.2023.45
• Lior Gishboliner, Nick Kushnir, and Asaf Shapira Testing Versus Estimation of Graph Properties, Revisited 10.4230/LIPIcs.APPROX/RANDOM.2023.46
• Joshua Cook and Ron D. Rothblum Efficient Interactive Proofs for Non-Deterministic Bounded Space 10.4230/LIPIcs.APPROX/RANDOM.2023.47
• Arijit Bishnu, Arijit Ghosh, and Gopinath Mishra On the Complexity of Triangle Counting Using Emptiness Queries 10.4230/LIPIcs.APPROX/RANDOM.2023.48
• Roy Gotlib and Tali Kaufman Fine Grained Analysis of High Dimensional Random Walks 10.4230/LIPIcs.APPROX/RANDOM.2023.49
• Venkatesan Guruswami and Shilun Li A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble 10.4230/LIPIcs.APPROX/RANDOM.2023.50
• Yahli Hecht, Dor Minzer, and Muli Safra NP-Hardness of Almost Coloring Almost 3-Colorable Graphs 10.4230/LIPIcs.APPROX/RANDOM.2023.51
• Swastik Kopparty and Vishvajeet N Extracting Mergers and Projections of Partitions 10.4230/LIPIcs.APPROX/RANDOM.2023.52
• Antonio Blanca and Xusheng Zhang Rapid Mixing of Global Markov Chains via Spectral Independence: The Unbounded Degree Case 10.4230/LIPIcs.APPROX/RANDOM.2023.53
• Amin Coja-Oghlan, Jane Gao, Max Hahn-Klimroth, Joon Lee, Noela Müller, and Maurice Rolvien The Full Rank Condition for Sparse Random Matrices 10.4230/LIPIcs.APPROX/RANDOM.2023.54
• Joshua Cook and Dana Moshkovitz Tighter MA/1 Circuit Lower Bounds from Verifier Efficient PCPs for PSPACE 10.4230/LIPIcs.APPROX/RANDOM.2023.55
• Eric Allender, Jacob Gray, Saachi Mutreja, Harsha Tirumala, and Pengxiang Wang Robustness for Space-Bounded Statistical Zero Knowledge 10.4230/LIPIcs.APPROX/RANDOM.2023.56
• Sepehr Assadi, Michael Kapralov, and Huacheng Yu On Constructing Spanners from Random Gaussian Projections 10.4230/LIPIcs.APPROX/RANDOM.2023.57
• Vikrant Ashvinkumar, Sepehr Assadi, Chengyuan Deng, Jie Gao, and Chen Wang Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance 10.4230/LIPIcs.APPROX/RANDOM.2023.58
• Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, and Samson Zhou How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity 10.4230/LIPIcs.APPROX/RANDOM.2023.59
• Fernando Granha Jeronimo Fast Decoding of Explicit Almost Optimal ε-Balanced q-Ary Codes And Fast Approximation of Expanding k-CSPs 10.4230/LIPIcs.APPROX/RANDOM.2023.60
• Renato Ferreira Pinto Jr. Directed Poincaré Inequalities and L¹ Monotonicity Testing of Lipschitz Functions 10.4230/LIPIcs.APPROX/RANDOM.2023.61
• Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, and Jakub Tětek Bias Reduction for Sum Estimation 10.4230/LIPIcs.APPROX/RANDOM.2023.62
• Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, and Nitin Saurabh On the Composition of Randomized Query Complexity and Approximate Degree 10.4230/LIPIcs.APPROX/RANDOM.2023.63
• Andreas Galanis, Leslie Ann Goldberg, and Paulina Smolarova Sampling from the Random Cluster Model on Random Regular Graphs at All Temperatures via Glauber Dynamics 10.4230/LIPIcs.APPROX/RANDOM.2023.64
• Karthik Gajulapalli, Alexander Golovnev, Satyajeet Nagargoje, and Sidhant Saraogi Range Avoidance for Constant Depth Circuits: Hardness and Algorithms 10.4230/LIPIcs.APPROX/RANDOM.2023.65
• Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, and Dragos Ristache Testing Connectedness of Images 10.4230/LIPIcs.APPROX/RANDOM.2023.66