Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth.
Falko HegerfeldStefan KratschPublished in: CoRR (2023)
Keyphrases
- optimization problems
- upper bound
- test problems
- worst case
- related problems
- combinatorial optimization
- np hard problems
- orders of magnitude
- difficult problems
- learning algorithm
- lower bound
- computational cost
- computational geometry
- approximate solutions
- space complexity
- computationally hard
- data sets
- hard problems
- computational complexity
- problems in computer vision
- reasoning problems
- search methods
- generalization error bounds
- iterative algorithms
- heuristic methods
- query evaluation
- benchmark datasets
- computationally efficient
- np complete
- neural network