ICML-Submodular Maximization subject to a Knapsack Constraint Combinatorial ...

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

Submodular Maximization Subject to a Knapsack Constraint:
     Combinatorial Algorithms with Near-Optimal Adaptive Complexity

           Georgios Amanatidis 1 Federico Fusco 2 Philip Lazos 2 Stefano Leonardi 2
               Alberto Marchetti-Spaccamela 2 Rebecca Reiffenhauser 2

            Abstract                cut functions in graphs and coverage functions.
   The growing need to deal with massive instances      Submodularity is often implicitly associated with mono-
   motivates the desi ...

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏0 回帖

关键词：maximization Constraint constrain Knapsack Subject