LIPIcs, Volume 207, APPROX/RANDOM 2021

• Mary Wootters and Laura Sanità LIPIcs, Volume 207, APPROX/RANDOM 2021, Complete Volume 10.4230/LIPIcs.APPROX/RANDOM.2021
• Mary Wootters and Laura Sanità Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.APPROX/RANDOM.2021.0
• Umang Bhaskar, A. R. Sricharan, and Rohit Vaish On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources 10.4230/LIPIcs.APPROX/RANDOM.2021.1
• Susanne Albers and Sebastian Schubert Optimal Algorithms for Online b-Matching with Variable Vertex Capacities 10.4230/LIPIcs.APPROX/RANDOM.2021.2
• Anupam Gupta, Amit Kumar, and Sahil Singla Bag-Of-Tasks Scheduling on Related Machines 10.4230/LIPIcs.APPROX/RANDOM.2021.3
• Anup Bhattacharya, Dishant Goyal, and Ragesh Jaiswal Hardness of Approximation for Euclidean k-Median 10.4230/LIPIcs.APPROX/RANDOM.2021.4
• Elena Grigorescu, Young-San Lin, and Kent Quanrud Online Directed Spanners and Steiner Forests 10.4230/LIPIcs.APPROX/RANDOM.2021.5
• Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar Query Complexity of Global Minimum Cut 10.4230/LIPIcs.APPROX/RANDOM.2021.6
• Eun Jung Kim, Euiwoong Lee, and Dimitrios M. Thilikos A Constant-Factor Approximation for Weighted Bond Cover 10.4230/LIPIcs.APPROX/RANDOM.2021.7
• János Balogh, Ilan Reuven Cohen, Leah Epstein, and Asaf Levin Truly Asymptotic Lower Bounds for Online Vector Bin Packing 10.4230/LIPIcs.APPROX/RANDOM.2021.8
• Karl Bringmann, Alejandro Cassis, Nick Fischer, and Marvin Künnemann Fine-Grained Completeness for Optimization in P 10.4230/LIPIcs.APPROX/RANDOM.2021.9
• Hossein Jowhari An Estimator for Matching Size in Low Arboricity Graphs with Two Applications 10.4230/LIPIcs.APPROX/RANDOM.2021.10
• Rajesh Jayaram and John Kallaugher An Optimal Algorithm for Triangle Counting in the Stream 10.4230/LIPIcs.APPROX/RANDOM.2021.11
• Omar El Housni, Vineet Goyal, Oussama Hanguir, and Clifford Stein Matching Drivers to Riders: A Two-Stage Robust Approach 10.4230/LIPIcs.APPROX/RANDOM.2021.12
• Allan Borodin, Calum MacRury, and Akash Rakheja Secretary Matching Meets Probing with Commitment 10.4230/LIPIcs.APPROX/RANDOM.2021.13
• Chien-Chung Huang and François Sellier Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching Constraint 10.4230/LIPIcs.APPROX/RANDOM.2021.14
• Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, and Danny Raz General Knapsack Problems in a Dynamic Setting 10.4230/LIPIcs.APPROX/RANDOM.2021.15
• Sandip Banerjee, Rafail Ostrovsky, and Yuval Rabani Min-Sum Clustering (With Outliers) 10.4230/LIPIcs.APPROX/RANDOM.2021.16
• Noah Singer, Madhu Sudan, and Santhoshini Velusamy Streaming Approximation Resistance of Every Ordering CSP 10.4230/LIPIcs.APPROX/RANDOM.2021.17
• Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, and Julian Wargalla Upper and Lower Bounds for Complete Linkage in General Metric Spaces 10.4230/LIPIcs.APPROX/RANDOM.2021.18
• Christian Konrad and Kheeran K. Naidu On Two-Pass Streaming Algorithms for Maximum Bipartite Matching 10.4230/LIPIcs.APPROX/RANDOM.2021.19
• Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, and Kamyar Khodamoradi Approximation Algorithms for Demand Strip Packing 10.4230/LIPIcs.APPROX/RANDOM.2021.20
• Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, and Malte Tutas Peak Demand Minimization via Sliced Strip Packing 10.4230/LIPIcs.APPROX/RANDOM.2021.21
• Arindam Khan and Eklavya Sharma Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items 10.4230/LIPIcs.APPROX/RANDOM.2021.22
• Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, and Anil Vullikanti Approximating Two-Stage Stochastic Supplier Problems 10.4230/LIPIcs.APPROX/RANDOM.2021.23
• Chandra Chekuri, Kent Quanrud, and Manuel R. Torres Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems 10.4230/LIPIcs.APPROX/RANDOM.2021.24
• Alexander Göke, Jochen Koenemann, Matthias Mnich, and Hao Sun Hitting Weighted Even Cycles in Planar Graphs 10.4230/LIPIcs.APPROX/RANDOM.2021.25
• Kshipra Bhawalkar, Kostas Kollias, and Manish Purohit Revenue Maximization in Transportation Networks 10.4230/LIPIcs.APPROX/RANDOM.2021.26
• Ralf Borndörfer, Katrin Casel, Davis Issac, Aikaterini Niklanovits, Stephan Schwartz, and Ziena Zeif Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs 10.4230/LIPIcs.APPROX/RANDOM.2021.27
• William M. Hoza Better Pseudodistributions and Derandomization for Space-Bounded Computation 10.4230/LIPIcs.APPROX/RANDOM.2021.28
• Zvika Brakerski, Noah Stephens-Davidowitz, and Vinod Vaikuntanathan On the Hardness of Average-Case k-SUM 10.4230/LIPIcs.APPROX/RANDOM.2021.29
• Vishwas Bhargava and Sumanta Ghosh Improved Hitting Set for Orbit of ROABPs 10.4230/LIPIcs.APPROX/RANDOM.2021.30
• David G. Harris, Fotis Iliopoulos, and Vladimir Kolmogorov A New Notion of Commutativity for the Algorithmic Lovász Local Lemma 10.4230/LIPIcs.APPROX/RANDOM.2021.31
• Kuikui Liu From Coupling to Spectral Independence and Blackbox Comparison with the Down-Up Walk 10.4230/LIPIcs.APPROX/RANDOM.2021.32
• Sankeerth Rao Karingula and Shachar Lovett Singularity of Random Integer Matrices with Large Entries 10.4230/LIPIcs.APPROX/RANDOM.2021.33
• Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, and Sayantan Sen Interplay Between Graph Isomorphism and Earth Mover’s Distance in the Query and Communication Worlds 10.4230/LIPIcs.APPROX/RANDOM.2021.34
• Yi Li and David P. Woodruff The Product of Gaussian Matrices Is Close to Gaussian 10.4230/LIPIcs.APPROX/RANDOM.2021.35
• Andreas Galanis, Leslie Ann Goldberg, and James Stewart Fast Mixing via Polymers for Random Graphs with Unbounded Degree 10.4230/LIPIcs.APPROX/RANDOM.2021.36
• Rocco A. Servedio and Li-Yang Tan Deterministic Approximate Counting of Polynomial Threshold Functions via a Derandomized Regularity Lemma 10.4230/LIPIcs.APPROX/RANDOM.2021.37
• Louis Golowich Improved Product-Based High-Dimensional Expanders 10.4230/LIPIcs.APPROX/RANDOM.2021.38
• Fotis Iliopoulos Improved Bounds for Coloring Locally Sparse Hypergraphs 10.4230/LIPIcs.APPROX/RANDOM.2021.39
• Rikhav Shah and Sandeep Silwal Smoothed Analysis of the Condition Number Under Low-Rank Perturbations 10.4230/LIPIcs.APPROX/RANDOM.2021.40
• Sumanta Ghosh and Rohit Gurjar Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision 10.4230/LIPIcs.APPROX/RANDOM.2021.41
• Srikanth Srinivasan and S. Venkitesh On the Probabilistic Degree of an n-Variate Boolean Function 10.4230/LIPIcs.APPROX/RANDOM.2021.42
• Antonio Blanca, Zongchen Chen, Daniel Štefankovič, and Eric Vigoda The Swendsen-Wang Dynamics on Trees 10.4230/LIPIcs.APPROX/RANDOM.2021.43
• Arijit Bishnu, Arijit Ghosh, and Gopinath Mishra Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube 10.4230/LIPIcs.APPROX/RANDOM.2021.44
• Guy Blanc, Jane Lange, Mingda Qiao, and Li-Yang Tan Decision Tree Heuristics Can Fail, Even in the Smoothed Setting 10.4230/LIPIcs.APPROX/RANDOM.2021.45
• Ninad Rajgopal and Rahul Santhanam On the Structure of Learnability Beyond P/Poly 10.4230/LIPIcs.APPROX/RANDOM.2021.46
• Antonio Blanca, Alistair Sinclair, and Xusheng Zhang The Critical Mean-Field Chayes-Machta Dynamics 10.4230/LIPIcs.APPROX/RANDOM.2021.47
• Sepehr Assadi and Soheil Behnezhad On the Robust Communication Complexity of Bipartite Matching 10.4230/LIPIcs.APPROX/RANDOM.2021.48
• Aditya Parulekar, Advait Parulekar, and Eric Price L1 Regression with Lewis Weights Subsampling 10.4230/LIPIcs.APPROX/RANDOM.2021.49
• Chandan Saha and Bhargav Thankey Hitting Sets for Orbits of Circuit Classes and Polynomial Families 10.4230/LIPIcs.APPROX/RANDOM.2021.50
• Talya Eden, Saleet Mossel, and Ronitt Rubinfeld Sampling Multiple Edges Efficiently 10.4230/LIPIcs.APPROX/RANDOM.2021.51
• Uma Girish, Ran Raz, and Wei Zhan Lower Bounds for XOR of Forrelations 10.4230/LIPIcs.APPROX/RANDOM.2021.52
• Jarosław Błasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, and Emanuele Viola Fourier Growth of Structured 𝔽₂-Polynomials and Applications 10.4230/LIPIcs.APPROX/RANDOM.2021.53
• Inbar Ben Yaacov, Gil Cohen, and Anand Kumar Narayanan Candidate Tree Codes via Pascal Determinant Cubes 10.4230/LIPIcs.APPROX/RANDOM.2021.54
• Amartya Shankha Biswas, Talya Eden, and Ronitt Rubinfeld Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time 10.4230/LIPIcs.APPROX/RANDOM.2021.55
• Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, and Madhu Sudan Ideal-Theoretic Explanation of Capacity-Achieving Decoding 10.4230/LIPIcs.APPROX/RANDOM.2021.56
• Omar Alrabiah and Venkatesan Guruswami Visible Rank and Codes with Locality 10.4230/LIPIcs.APPROX/RANDOM.2021.57
• Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, and Salil Vadhan Pseudorandom Generators for Read-Once Monotone Branching Programs 10.4230/LIPIcs.APPROX/RANDOM.2021.58
• Varsha Dani, Diksha Gupta, and Thomas P. Hayes On the Power of Choice for k-Colorability of Random Graphs 10.4230/LIPIcs.APPROX/RANDOM.2021.59
• Sumegha Garg, Pravesh K. Kothari, Pengda Liu, and Ran Raz Memory-Sample Lower Bounds for Learning Parity with Noise 10.4230/LIPIcs.APPROX/RANDOM.2021.60
• Reut Levi and Nadav Shoshan Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs 10.4230/LIPIcs.APPROX/RANDOM.2021.61
• Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, and Wei Zhan Parallel Repetition for the GHZ Game: A Simpler Proof 10.4230/LIPIcs.APPROX/RANDOM.2021.62