The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization

Taneli Mielikäinen Esko Ukkonen

Published in: CoRR (2004)

Keyphrases

greedy algorithm
worst case
space complexity
computational cost
computational complexity
combinatorial optimization
objective function
random walk
lower complexity
neural network
maximum number
optimization problems
np hard
evolutionary algorithm
reinforcement learning
feature selection
computer vision
real world