A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization 论文

2015SIAM Journal on Computing引用 227
DOI
Complexity and Algorithms in GraphsCryptography and Data SecurityOptimization and Search Problems
Cryptography and Data SecurityComplexity and Algorithms in GraphsComputational Geometry and Mesh Generation
相关技术:Computational Geometry and Mesh GenerationComplexity and Algorithms in Graphs
关系图谱

A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization · 相关技术

相关技术

Computational Geometry and Mesh GenerationComplexity and Algorithms in Graphs