Faster parameterized algorithms for modification problems to minor-closed classes.
Laure MorelleIgnasi SauGiannos StamoulisDimitrios M. ThilikosPublished in: CoRR (2022)
Keyphrases
- optimization problems
- problems in computer vision
- related problems
- practical problems
- benchmark problems
- run times
- learning algorithm
- np hard problems
- computational problems
- combinatorial optimization
- orders of magnitude
- test problems
- computationally efficient
- hard problems
- theoretical analysis
- difficult problems
- times faster
- exact algorithms
- binary classification problems
- reasoning problems
- computationally demanding
- data structure
- data streams
- inference problems
- greedy algorithms
- evolutionary algorithm
- specific problems
- multi class