Tight Algorithms for Connectivity Problems Parameterized by Clique-Width.
Falko HegerfeldStefan KratschPublished in: ESA (2023)
Keyphrases
- optimization problems
- computational problems
- benchmark problems
- np hard problems
- significant improvement
- worst case
- data structure
- specific problems
- approximate solutions
- hard problems
- computationally efficient
- upper bound
- lower bound
- benchmark datasets
- convex optimization problems
- combinatorial optimization
- machine learning algorithms
- computationally hard
- heuristic methods
- practical problems
- difficult problems
- computational cost
- problems in computer vision
- run times
- related problems
- test problems
- search methods
- times faster
- computational complexity