Perfectly Matched Sets in Graphs: Hardness, Kernelization Lower Bound, and FPT and Exact Algorithms.
N. R. AravindRoopam SaxenaPublished in: CoRR (2021)
Keyphrases
- exact algorithms
- lower bound
- exact solution
- max sat
- np hard
- approximation algorithms
- worst case
- upper bound
- fixed parameter tractable
- knapsack problem
- computational problems
- vehicle routing problem with time windows
- optimal solution
- branch and bound algorithm
- heuristic methods
- benders decomposition
- branch and bound
- combinatorial optimization problems
- combinatorial optimization
- lower and upper bounds
- graph matching
- computational complexity
- objective function
- decision problems
- combinatorial problems
- greedy algorithm
- linear program
- constraint satisfaction
- linear programming
- simulated annealing
- scheduling problem