A note on maximizing a submodular set function subject to a knapsack constraint 论文

2003Operations Research Letters引用 688
DOI
Complexity and Algorithms in GraphsComputational Geometry and Mesh GenerationAdvanced Graph Theory Research
Advanced Graph Theory ResearchComplexity and Algorithms in GraphsComputational Geometry and Mesh Generation
相关技术:Computational Geometry and Mesh GenerationComplexity and Algorithms in Graphs
关系图谱

A note on maximizing a submodular set function subject to a knapsack constraint · 相关文章

暂无数据