Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs.
Sayan BandyapadhyayWilliam LochetDaniel LokshtanovSaket SaurabhJie XuePublished in: SODA (2022)
Keyphrases
- optimization problems
- problems in computer vision
- graph theory
- hard problems
- benchmark problems
- computationally efficient
- planar graphs
- related problems
- computational complexity
- worst case
- computational cost
- lower bound
- optimal solution
- practical problems
- approximate solutions
- clustering algorithm
- computational geometry
- theoretical guarantees
- genetic algorithm
- data mining