New Query Lower Bounds for Submodular Function MInimization

  title={New Query Lower Bounds for Submodular Function MInimization},
  author={A. Graur and Tristan Pollner and Vidhya Ramaswamy and S. Weinberg},
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}(n^2)$ queries [LeeSW15], yet the best-known lower bound has never been improved beyond $n$ [Harvey08]. We provide a query lower bound of $2n$ for submodular function minimization, a $3n/2-2$ query lower… Expand
6 Citations
Query Complexity of Global Minimum Cut
  • 2
  • PDF
Nearly Linear Time Algorithms and Lower Bound for Submodular Maximization
  • 2
Optimal Algorithm and Lower Bound for Submodular Maximization
  • W. Li
  • Computer Science
  • 2020
  • PDF
On the cut dimension of a graph
  • 1
  • PDF
Discrete Convex Simulation Optimization
  • 1
  • Highly Influenced
  • PDF


Computing Exact Minimum Cuts Without Knowing the Graph
  • 23
  • PDF
Improved algorithms for submodular function minimization and submodular flow
  • 34
  • PDF
Matchings, matroids and submodular functions
  • 15
  • PDF
Minimizing symmetric submodular functions
  • 165
Subquadratic submodular function minimization
  • 26
  • PDF
A faster strongly polynomial time algorithm for submodular function minimization
  • J. Orlin
  • Mathematics, Computer Science
  • Math. Program.
  • 2009
  • 247
  • PDF
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
  • 176
  • PDF