A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems.
Justin WardPublished in: STACS (2012)
Keyphrases
- submodular functions
- packing problem
- computational complexity
- error tolerance
- initial set
- objective function
- error bounds
- optimization algorithm
- theoretical analysis
- worst case
- learning algorithm
- optimal solution
- experimental evaluation
- dynamic programming
- np hard
- approximation ratio
- k means
- decomposition algorithm
- input data
- expectation maximization
- segmentation algorithm
- computational cost
- convex hull
- special case
- matching algorithm
- cost function
- detection algorithm
- upper bound