Deterministic Algorithms for Submodular Maximization Problems

  title={Deterministic Algorithms for Submodular Maximization Problems},
  author={Niv Buchbinder and Moran Feldman},
Randomization is a fundamental tool used in many theoretical and practical areas of computer science. We study here the role of randomization in the area of submodular function maximization. In this area, most algorithms are randomized, and in almost all cases the approximation ratios obtained by current randomized algorithms are superior to the best results obtained by known deterministic algorithms. Derandomization of algorithms for general submodular function maximization seems hard since… CONTINUE READING