most citedBounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotone Submodular Maximization

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2013★ 2 cited

Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotone Submodular Maximization

Norman Huang, Allan Borodin

Unconstrained submodular maximization captures many NP-hard combinatorial optimization problems, including Max-Cut, Max-Di-Cut, and variants of facility location problems. Recently…