default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAPPROX/RANDOM 2021 [Virtual Conference]
- Mary Wootters
, Laura Sanità:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, University of Washington, Seattle, Washington, USA (Virtual Conference), August 16-18, 2021. LIPIcs 207, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-207-5 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:10
- Umang Bhaskar, A. R. Sricharan, Rohit Vaish:
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. 1:1-1:23 - Susanne Albers, Sebastian Schubert:
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities. 2:1-2:18 - Anupam Gupta, Amit Kumar, Sahil Singla:
Bag-Of-Tasks Scheduling on Related Machines. 3:1-3:16 - Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal:
Hardness of Approximation for Euclidean k-Median. 4:1-4:23 - Elena Grigorescu, Young-San Lin, Kent Quanrud:
Online Directed Spanners and Steiner Forests. 5:1-5:25 - Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Query Complexity of Global Minimum Cut. 6:1-6:15 - Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos:
A Constant-Factor Approximation for Weighted Bond Cover. 7:1-7:14 - János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin:
Truly Asymptotic Lower Bounds for Online Vector Bin Packing. 8:1-8:18 - Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann:
Fine-Grained Completeness for Optimization in P. 9:1-9:22 - Hossein Jowhari:
An Estimator for Matching Size in Low Arboricity Graphs with Two Applications. 10:1-10:13 - Rajesh Jayaram, John Kallaugher:
An Optimal Algorithm for Triangle Counting in the Stream. 11:1-11:11 - Omar El Housni, Vineet Goyal, Oussama Hanguir, Clifford Stein:
Matching Drivers to Riders: A Two-Stage Robust Approach. 12:1-12:22 - Allan Borodin, Calum MacRury, Akash Rakheja:
Secretary Matching Meets Probing with Commitment. 13:1-13:23 - Chien-Chung Huang, François Sellier:
Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching Constraint. 14:1-14:18 - Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz:
General Knapsack Problems in a Dynamic Setting. 15:1-15:18 - Sandip Banerjee, Rafail Ostrovsky, Yuval Rabani:
Min-Sum Clustering (With Outliers). 16:1-16:16 - Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming Approximation Resistance of Every Ordering CSP. 17:1-17:19 - Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt, Julian Wargalla:
Upper and Lower Bounds for Complete Linkage in General Metric Spaces. 18:1-18:22 - Christian Konrad, Kheeran K. Naidu:
On Two-Pass Streaming Algorithms for Maximum Bipartite Matching. 19:1-19:18 - Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi:
Approximation Algorithms for Demand Strip Packing. 20:1-20:24 - Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas:
Peak Demand Minimization via Sliced Strip Packing. 21:1-21:24 - Arindam Khan, Eklavya Sharma:
Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items. 22:1-22:23 - Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Approximating Two-Stage Stochastic Supplier Problems. 23:1-23:22 - Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. 24:1-24:21 - Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun:
Hitting Weighted Even Cycles in Planar Graphs. 25:1-25:23 - Kshipra Bhawalkar, Kostas Kollias, Manish Purohit:
Revenue Maximization in Transportation Networks. 26:1-26:16 - Ralf Borndörfer, Katrin Casel, Davis Issac, Aikaterini Niklanovits, Stephan Schwartz, Ziena Zeif:
Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs. 27:1-27:14 - William M. Hoza:
Better Pseudodistributions and Derandomization for Space-Bounded Computation. 28:1-28:23 - Zvika Brakerski, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
On the Hardness of Average-Case k-SUM. 29:1-29:19 - Vishwas Bhargava, Sumanta Ghosh:
Improved Hitting Set for Orbit of ROABPs. 30:1-30:23 - David G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov:
A New Notion of Commutativity for the Algorithmic Lovász Local Lemma. 31:1-31:25 - Kuikui Liu:
From Coupling to Spectral Independence and Blackbox Comparison with the Down-Up Walk. 32:1-32:21 - Sankeerth Rao Karingula, Shachar Lovett:
Singularity of Random Integer Matrices with Large Entries. 33:1-33:16 - Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Interplay Between Graph Isomorphism and Earth Mover's Distance in the Query and Communication Worlds. 34:1-34:23 - Yi Li, David P. Woodruff:
The Product of Gaussian Matrices Is Close to Gaussian. 35:1-35:22 - Andreas Galanis, Leslie Ann Goldberg, James Stewart:
Fast Mixing via Polymers for Random Graphs with Unbounded Degree. 36:1-36:13 - Rocco A. Servedio, Li-Yang Tan:
Deterministic Approximate Counting of Polynomial Threshold Functions via a Derandomized Regularity Lemma. 37:1-37:18 - Louis Golowich:
Improved Product-Based High-Dimensional Expanders. 38:1-38:17 - Fotis Iliopoulos:
Improved Bounds for Coloring Locally Sparse Hypergraphs. 39:1-39:16 - Rikhav Shah, Sandeep Silwal:
Smoothed Analysis of the Condition Number Under Low-Rank Perturbations. 40:1-40:21 - Sumanta Ghosh, Rohit Gurjar:
Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision. 41:1-41:16 - Srikanth Srinivasan, S. Venkitesh:
On the Probabilistic Degree of an n-Variate Boolean Function. 42:1-42:20 - Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
The Swendsen-Wang Dynamics on Trees. 43:1-43:15 - Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube. 44:1-44:22 - Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan:
Decision Tree Heuristics Can Fail, Even in the Smoothed Setting. 45:1-45:16 - Ninad Rajgopal, Rahul Santhanam:
On the Structure of Learnability Beyond P/Poly. 46:1-46:23 - Antonio Blanca, Alistair Sinclair, Xusheng Zhang:
The Critical Mean-Field Chayes-Machta Dynamics. 47:1-47:15 - Sepehr Assadi, Soheil Behnezhad:
On the Robust Communication Complexity of Bipartite Matching. 48:1-48:17 - Aditya Parulekar, Advait Parulekar, Eric Price:
L1 Regression with Lewis Weights Subsampling. 49:1-49:21 - Chandan Saha, Bhargav Thankey:
Hitting Sets for Orbits of Circuit Classes and Polynomial Families. 50:1-50:26 - Talya Eden, Saleet Mossel, Ronitt Rubinfeld:
Sampling Multiple Edges Efficiently. 51:1-51:15 - Uma Girish, Ran Raz, Wei Zhan:
Lower Bounds for XOR of Forrelations. 52:1-52:14 - Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola:
Fourier Growth of Structured 𝔽2-Polynomials and Applications. 53:1-53:20 - Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan:
Candidate Tree Codes via Pascal Determinant Cubes. 54:1-54:22 - Amartya Shankha Biswas, Talya Eden, Ronitt Rubinfeld:
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time. 55:1-55:19 - Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. 56:1-56:21 - Omar Alrabiah, Venkatesan Guruswami:
Visible Rank and Codes with Locality. 57:1-57:18 - Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan:
Pseudorandom Generators for Read-Once Monotone Branching Programs. 58:1-58:21 - Varsha Dani, Diksha Gupta, Thomas P. Hayes:
On the Power of Choice for k-Colorability of Random Graphs. 59:1-59:17 - Sumegha Garg, Pravesh K. Kothari, Pengda Liu, Ran Raz:
Memory-Sample Lower Bounds for Learning Parity with Noise. 60:1-60:19 - Reut Levi, Nadav Shoshan:
Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs. 61:1-61:23 - Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan:
Parallel Repetition for the GHZ Game: A Simpler Proof. 62:1-62:19
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-14 00:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
