Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems.
Friedrich EisenbrandLars RohwedderKarol WegrzyckiPublished in: CoRR (2024)
Keyphrases
- combinatorial optimization
- optimization problems
- exact and approximate
- approximate solutions
- test problems
- benchmark problems
- learning algorithm
- computational cost
- difficult problems
- related problems
- brute force
- orders of magnitude
- practical problems
- machine learning algorithms
- computationally hard
- data structure
- run times
- problems in computer vision
- computational problems
- search methods
- computationally efficient
- np complete
- worst case
- computational complexity
- combinatorial problems
- exact solution
- data sets
- benchmark datasets
- theoretical analysis
- evolutionary algorithm
- hard problems
- machine learning