Parameterized complexity of MinCSP over the point algebra
From MaRDI portal
Cites work
- A fixed-parameter algorithm for the directed feedback vertex set problem
- Almost consistent systems of linear equations
- Directed flow-augmentation
- Directed multicut is W[1]-hard, even for four terminal pairs
- Directed subset feedback vertex set is fixed-parameter tractable
- Exact and approximation algorithms for the maximum constraint satisfaction problem over the point algebra
- Finding odd cycle transversals.
- Fixed-parameter Approximability of Boolean MinCSPs
- 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
- Hardness of vertex deletion and project scheduling
- Maintaining knowledge about temporal intervals
- Multicut Is FPT
- On the parameterized complexity of symmetric directed multicut
- On the power of unique 2-prover 1-round games
- On Weighted Graph Separation Problems and Flow Augmentation
- Parameterized algorithms
- Parameterized complexity classification for interval constraints
- Parameterized complexity of equality MinCSP
- Parameterized graph separation problems
- Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
- Simple proof of hardness of feedback vertex set
- Solving hard cut problems via flow-augmentation
- The complexity of equality constraint languages
- The complexity of satisfiability problems
- The complexity of temporal constraint satisfaction problems
Cited in
(2)- Temporal valued constraint satisfaction problems
- Parameterized approximability for modular linear equations
This page was built for publication: Parameterized complexity of MinCSP over the point algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253162)
