Improved lower bounds on the approximability of Multiway Cut using Sherali-Adams relaxations
cs.DS, cs.CC
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Toward a Uniform Algorithm and Uniform Reduction for Constraint Problems
- Simplex based Steiner tree instances yield large integrality gaps for the bidirected cut relaxation
- Singleton algorithms for the Constraint Satisfaction Problem
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles