Scenario Submodular Cover

Grammel, N; Hellerstein, L; Kletenik, D; Lin, P

Hellerstein, L (reprint author), NYU, Tandon Sch Engn, Dept Comp Sci & Engn, Brooklyn, NY 10003 USA.

APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2016), 2017; 10138 ( ): 116

Abstract

We introduce the Scenario Submodular Cover problem. In this problem, the goal is to produce a cover with minimum expected cost, with respect to an emp......

Full Text Link


Links

期刊讨论 | 中国SCI论文 | 期刊主页 | 投稿经验 | 杂志官网 | 投稿链接 | 作者需知 | PMC链接 | Pubmed全文检索