A $(k + 3)/2$-approximation algorithm for monotone submodular maximization over a $k$-exchange system
Justin WardPublished in: CoRR (2011)
Keyphrases
- objective function
- experimental evaluation
- computational complexity
- preprocessing
- simulated annealing
- cost function
- search space
- worst case
- approximation ratio
- improved algorithm
- optimization algorithm
- high accuracy
- data sets
- computational cost
- dynamic programming
- np hard
- significant improvement
- computationally efficient
- detection algorithm
- monte carlo
- k means
- linear programming
- theoretical analysis
- search algorithm
- tree structure
- convex hull
- bayesian networks
- piecewise constant
- polygonal approximation
- learning algorithm