Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes.
Laure MorelleIgnasi SauGiannos StamoulisDimitrios M. ThilikosPublished in: ICALP (2023)
Keyphrases
- optimization problems
- data structure
- computationally efficient
- run times
- approximate solutions
- orders of magnitude
- binary classification problems
- theoretical guarantees
- computational problems
- inference problems
- computational complexity
- np complete
- computationally hard
- theoretical analysis
- hard problems
- combinatorial optimization
- greedy algorithms
- graph theory
- highly efficient
- related problems
- objective function
- learning algorithm
- memory efficient
- benchmark problems
- convex optimization problems
- pattern classification problems
- exact algorithms
- problems in computer vision
- data sets
- times faster
- decision problems
- lower bound
- search algorithm
- data mining
- neural network