New Query Lower Bounds for Submodular Function MInimization

• Published in: arXiv.org
• Main Authors: Graur, Andrei, Pollner, Tristan, Ramaswamy, Vidhya, Weinberg, S Matthew
• Format: Paper
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 15.11.2019
• Subjects: Algorithms; Lower bounds; Optimization; Production scheduling; Queries

We consider submodular function minimization in the oracle model: given black-box access to a submodular set function \(f:2^{[n]}\rightarrow \mathbb{R}\), find an element of \(\arg\min_S \{f(S)\}\) using as few queries to \(f(\cdot)\) as possible. State-of-the-art algorithms succeed with \(\tilde{O}...