Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments.
Gaétan BertheMarin BougeretDaniel GonçalvesJean-Florent RaymondPublished in: CoRR (2023)
Keyphrases
- optimization problems
- combinatorial optimization
- related problems
- benchmark problems
- computational cost
- graph theory
- problems in computer vision
- data structure
- approximate solutions
- computational complexity
- difficult problems
- theoretical analysis
- test problems
- orders of magnitude
- computationally efficient
- decision trees
- hard problems
- computational geometry
- specific problems
- worst case
- search algorithm
- optimal solution