ملف الباحث
Chao Qian
ورقة واحدة في مجموعة PaperMetrix
المنشورات
أوراق هذا المؤلف
-
Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection
2018
Subset selection is a fundamental problem in many areas, which aims to select the best subset of size at most $k$ from a universe. Greedy algorithms are widely used for subset selection, and have shown …