Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem 论文

1984Discrete Applied Mathematics引用 343
DOI
Complexity and Algorithms in GraphsAdvanced Graph Theory ResearchComputational Geometry and Mesh Generation
Advanced Graph Theory ResearchComplexity and Algorithms in GraphsComputational Geometry and Mesh Generation
相关技术:Computational Geometry and Mesh GenerationComplexity and Algorithms in Graphs
关系图谱

Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem · 相关文章

暂无数据