Optimizing Ratio of Monotone Set Functions

@inproceedings{Qian2017OptimizingRO,
  title={Optimizing Ratio of Monotone Set Functions},
  author={Chao Qian and Jing-Cheng Shi and Yang Yu and Ke Tang and Zhi-Hua Zhou},
  booktitle={IJCAI},
  year={2017}
}
This paper considers the problem of minimizing the ratio of two set functions, i.e., f/g. Previous work assumed monotone and submodular of the two functions, while we consider a more general situation where g is not necessarily submodular. We derive that the greedy approach GreedRatio, as a fixed time algorithm, achieves a |X ∗| (1+(|X∗|−1)(1−κf ))γ(g… CONTINUE READING