Faster parameterized algorithms for two vertex deletion problems.
Dekel TsurPublished in: Theor. Comput. Sci. (2023)
Keyphrases
- optimization problems
- related problems
- np hard problems
- problems in computer vision
- benchmark problems
- test problems
- convex optimization problems
- specific problems
- computationally efficient
- hard problems
- theoretical analysis
- approximate solutions
- computational cost
- orders of magnitude
- difficult problems
- combinatorial optimization
- times faster
- decision trees
- heuristic methods
- benchmark datasets
- search methods
- constraint programming
- memory efficient
- computational geometry
- theoretical guarantees
- data mining techniques
- computational problems
- computationally demanding
- worst case
- decision problems