The problem of maximizing a submodular set function with multiple constraints is considered, which has important application in combinatorial optimization theory.
提出了多维约束下下模函数最大值问题，分析其在组合优化中的重要应用。
The problem of maximizing a submodular set function with multiple constraints is considered, which has important application in combinatorial optimization theory.
提出了多维约束下下模函数最大值问题，分析其在组合优化中的重要应用。
应用推荐