Random Pseudo-Polynomial Algorithms for Exact Matroid Problems.
Paolo M. CameriniGiulia GalbiatiFrancesco MaffioliPublished in: J. Algorithms (1992)
Keyphrases
- optimization problems
- combinatorial optimization
- np hard problems
- test problems
- computational complexity
- computational problems
- approximate solutions
- orders of magnitude
- data structure
- evolutionary algorithm
- significant improvement
- exact algorithms
- practical problems
- brute force
- related problems
- benchmark problems
- exact and approximate
- hard problems
- worst case
- greedy algorithms
- specific problems
- theoretical guarantees
- computationally hard
- learning algorithm
- problems in computer vision
- difficult problems
- greedy algorithm
- decision problems
- np complete
- partial solutions
- machine learning algorithms
- dynamic programming
- data sets
- run times
- average case complexity