An Improved Approximation for Maximum Weighted k-Set Packing
|
2023 |
Thiery, Theophile |
Efficient Decoding Up to a Constant Fraction of the Code Length for Asymptotically Good Quantum Codes
|
2023 |
Leverrier, Anthony |
Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut
|
2023 |
Chen, Lijie |
Passing the Limits of Pure Local Search for Weighted k-set Packing
|
2023 |
Neuwohner, Meike |
Unique Games Hardness of Quantum Max-Cut, and a Conjectured Vector-Valued Borell’s Inequality
|
2023 |
Hwang, Yeongwoo |
Learning Hierarchical Cluster Structure of Graphs in Sublinear Time
|
2023 |
Kapralov, Michael |
Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median
|
2023 |
Gowda, Kishen N. |
On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem
|
2023 |
Kao, Mong-Jen |
Quantum Tomography Using State-Preparation Unitaries
|
2023 |
Apeldoorn, Joran van |
On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings
|
2023 |
Chan, Timothy M. |
Curve Simplification and Clustering under Fréchet Distance
|
2023 |
Cheng, Siu-Wing |
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Euclidean Travelling Salesman Tours
|
2023 |
Dross, François |
Low Degree Testing over the Reals
|
2023 |
Arora, Vipul |
Streaming Algorithms for the Missing Item Finding Problem
|
2023 |
Stoeckl, Manuel |
The ℓp-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines
|
2023 |
Li, Yi |
Single-Pass Streaming Algorithms for Correlation Clustering
|
2023 |
Behnezhad, Soheil |
Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median
|
2023 |
Viallat, Vincent Cohen-Addad |
A Nearly Tight Analysis of Greedy k-means
|
2023 |
Grunau, Christoph |
Mean Estimation When You Have the Source Code; or, Quantum Monte Carlo Methods
|
2023 |
Kothari, Robin |
Testing and Learning Quantum Juntas Nearly Optimally
|
2023 |
Chen, Thomas |