Vertex connectivity augmentation is FPT parameterized by λ and k with running time 2^{O(k log(k+λ))} n^{O(1)}; edge connectivity augmentation is FPT parameterized by k alone.
Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More , booktitle =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Gives an approximation algorithm for satisfiable instances of generalized linear equation CSPs over finite groups that is optimal for certain S, while the predicate remains approximation resistant on almost-satisfiable instances.
citing papers explorer
-
Connectivity augmentation is fixed-parameter tractable
Vertex connectivity augmentation is FPT parameterized by λ and k with running time 2^{O(k log(k+λ))} n^{O(1)}; edge connectivity augmentation is FPT parameterized by k alone.
-
Optimal Inapproximability of Generalized Linear Equations over a Finite Group
Gives an approximation algorithm for satisfiable instances of generalized linear equation CSPs over finite groups that is optimal for certain S, while the predicate remains approximation resistant on almost-satisfiable instances.