A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity.

Tasuku Soma Yuichi Yoshida

Published in: CoRR (2017)

Keyphrases

submodular functions
greedy algorithm
approximation guarantees
objective function
greedy algorithms
approximation ratio
worst case
facility location problem
dynamic programming
approximation algorithms
probabilistic model
linear programming
kernel methods