Similar Items: Thin Trees for Near Minimum Cuts
- On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank
- Nearly Optimal Attention Coresets
- EPTAS for Hard Graph Cut Problems for Dense Graphs
- Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm
- Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition
- Nearly-Tight Bounds for Zonotope Containment and Beyond