Tight algorithms for connectivity problems parameterized by clique-width.
Falko HegerfeldStefan KratschPublished in: CoRR (2023)
Keyphrases
- optimization problems
- np hard problems
- combinatorial optimization
- difficult problems
- learning algorithm
- run times
- greedy algorithms
- computationally efficient
- worst case
- hard problems
- benchmark problems
- times faster
- evolutionary algorithm
- data structure
- related problems
- test problems
- orders of magnitude
- benchmark datasets
- computational complexity
- binary images
- search algorithm
- lower bound
- partial solutions
- computational geometry
- specific problems
- reinforcement learning
- upper bound
- computationally hard
- decision trees
- genetic algorithm