On the (Parameterized) Complexity of Almost Stable Marriage.
Sushmita GuptaPallavi JainSanjukta RoySaket SaurabhMeirav ZehaviPublished in: FSTTCS (2020)
Keyphrases
- stable marriage
- parameterized complexity
- partial order
- related problems
- soft constraints
- fixed parameter tractable
- global constraints
- computational problems
- symmetry breaking
- lower bound
- multi dimensional
- np complete
- inductive logic programming
- knapsack problem
- database
- logic programming
- np hard
- special case
- optimal solution
- decision making