On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms.
Sergey S. KetkovOleg A. ProkopyevPublished in: CoRR (2024)
Keyphrases
- computational complexity
- optimization problems
- worst case
- polynomial time complexity
- computational issues
- np complete
- np hardness
- high computational complexity
- convex optimization problems
- benchmark problems
- space complexity
- problems in computer vision
- polynomial hierarchy
- hypothesis spaces
- tractable cases
- complexity bounds
- computationally hard
- practical problems
- partial solutions
- complexity analysis
- planar graphs
- metaheuristic
- run times
- learning algorithm
- convex functions
- np hard
- computational cost
- fixed parameter tractable
- markov random field
- decision problems
- search methods
- approximation algorithms
- computational problems
- binary classification problems