Complexity of local search for CSPs parameterized by constraint difference
From MaRDI portal
Cites work
- \textsc{Multicut} is FPT
- A parameterized approximation scheme for min \(k\)-cut
- Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
- Almost consistent systems of linear equations
- Designing FPT algorithms for cut problems using randomized contractions
- Directed flow-augmentation
- Fixed-parameter tractability of multicut parameterized by the size of the cutset
- Flow-augmentation. III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
- Graph minors. XIII: The disjoint paths problem
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- Local search: is brute-force avoidable?
- LP can be a cure for parameterized problems
- Minimum bisection is fixed parameter tractable
- On multiway cut parameterized above lower bounds
- On the hardness of losing weight
- Parameterized complexity of constraint satisfaction problems
- Paths, flowers and vertex cover
- Solving hard cut problems via flow-augmentation
- Stable assignment with couples: parameterized complexity and local search
- The minimum k-way cut of bounded size is fixed-parameter tractable
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT
This page was built for publication: Complexity of local search for CSPs parameterized by constraint difference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356354)
