Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth.
Falko HegerfeldStefan KratschPublished in: WG (2023)
Keyphrases
- optimization problems
- benchmark problems
- upper bound
- worst case
- combinatorial optimization
- learning algorithm
- computationally efficient
- orders of magnitude
- data structure
- problems in computer vision
- search methods
- computational cost
- benchmark datasets
- search space
- space complexity
- related problems
- practical problems
- difficult problems
- approximate solutions
- specific problems
- np hard problems
- convex optimization problems
- partial solutions
- lower bound
- hard problems
- run times
- tree decompositions