On complexity of maximizatin of submodular functions*

DOI10.1080/02331939808844419zbMath0936.90037OpenAlexW2014472857MaRDI QIDQ4256098

Eberhard Girlich, Michail M. Kovalev, Unnamed Author

Publication date: 22 May 2000

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939808844419

zbMATH Keywords

submodular functionlocal maximaShannon-optimal algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10)

Cites Work

• Every poset has a central element
• Lower bounds on the worst-case complexity of some oracle algorithms
• Searching ordered structures
• Searching in Trees, Series-Parallel and Interval Orders
• Searching in 2-dimensional partial orders
• Complexity of Matroid Property Algorithms

This page was built for publication: On complexity of maximizatin of submodular functions^*