| An O(n5/4) Time ∊-Approximation Algorithm for RMS Matching in a Plane
|
2021 |
Lahn, Nathaniel |
| Coloring and Maximum Weight Independent Set of Rectangles
|
2021 |
Chalermsook, Parinya |
| PTAS for Minimum Cost Multi-covering with Disks
|
2021 |
Huang, Ziyun |
| Quantum Algorithms for Graph Problems with Cut Queries
|
2021 |
Lee, Troy |
| Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler
|
2021 |
Ji, Zhengfeng |
| Minimizing Convex Functions with Integral Minimizers
|
2021 |
Jiang, Haotian |
| A Local Search Framework for Experimental Design
|
2021 |
Lau, Lap Chi |
| Optimal Contextual Pricing and Extensions
|
2021 |
Liu, Allen |
| Static and Streaming Data Structures for Fréchet Distance Queries
|
2021 |
Filtser, Arnold |
| Vertex Sparsification for Edge Connectivity
|
2021 |
Chalermsook, Parinya |
| Analytic Quantum Weak Coin Flipping Protocols with Arbitrarily Small Bias
|
2021 |
Arora, Atul Singh |
| Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover
|
2021 |
Bansal, Nikhil |
| Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions
|
2021 |
Chandrasekaran, Karthekeyan |
| New Data Structures for Orthogonal Range Reporting and Range Minima Queries
|
2021 |
Nekrich, Yakov |
| An Efficient ∊-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization
|
2021 |
Cai, Yang |
| Non-Excludable Dynamic Mechanism Design
|
2021 |
Balseiro, Santiago R. |
| Competitive Allocation of a Mixed Manna
|
2021 |
Chaudhury, Bhaskar Ray |
| Fast Convergence of Fictitious Play for Diagonal Payoff Matrices
|
2021 |
Abernethy, Jacob |
| Spectral Sparsification of Metrics and Kernels
|
2021 |
Quanrud, Kent |
| (Near-)Linear-Time Randomized Algorithms for Row Minima in Monge Partial Matrices and Related Problems
|
2021 |
Chan, Timothy M. |
Tag hinzufügen