Discretely Beyond 1 /e: Guided Combinatorial Algorithms for Submodular Maximization

These are achieved by guiding the randomized greedy algorithm with a fast local search algorithm. Further, we develop deterministic versions of these algorithms, maintaining the same ratio and asymptotic time complexity.