Near Optimal Algorithms for Hard Submodular Programs with Discounted Cooperative Costs.
Rishabh K. IyerJeff A. BilmesPublished in: CoRR (2019)
Keyphrases
- cooperative
- recently developed
- computational complexity
- theoretical analysis
- orders of magnitude
- worst case
- hard problems
- data structure
- significant improvement
- computational cost
- markov decision processes
- data mining algorithms
- optimization problems
- multi class
- learning algorithm
- dynamic programming
- search algorithm
- bayesian networks
- database systems