Filtered Search for Submodular Maximization with Controllable Approximation BoundsDownload PDFOpen Website

2015 (modified: 06 Nov 2022)AISTATS 2015Readers: Everyone
Abstract: Most existing submodular maximization algorithms provide theoretical guarantees with approximation bounds. However, in many cases, users may be interested in an anytime algorithm that can offer a f...
0 Replies

Loading