Optimum algorithm for maximization of submodular functions

MaRDI QIDQ806671zbMATH OpenFDO

Authors Alexander Genkin, Ilya B. Muchnik

Publication date 1990

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

Boolean cubeShannon-optimum maximumsubmodular function

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On complexity of maximizatin of submodular functions^*
• scientific article; zbMATH DE number 4053525
• Techniques for submodular maximization
• Maximization of submodular functions: theory and enumeration algorithms
• On submodular function minimization

Cited in

(13)

• Maximization of submodular functions: theory and enumeration algorithms
• Fixed points approach to clustering
• Optimizations of the subresultant algorithm
• Dijkstra's algorithm and L-concave function maximization
• scientific article; zbMATH DE number 5888315 (Why is no real title available?)
• scientific article; zbMATH DE number 4131662 (Why is no real title available?)
• scientific article; zbMATH DE number 5319970 (Why is no real title available?)
• scientific article; zbMATH DE number 4095384 (Why is no real title available?)
• On complexity of maximizatin of submodular functions^*
• Deterministic Algorithms for Submodular Maximization Problems
• An analysis of nonconforming multi-grid methods, leading to an improved method for the Morley element
• The adaptive complexity of maximizing a submodular function
• Algorithms for maximization of supermodular functions and their application in the optimization of grouping provinces in a region

This page was built for publication: Optimum algorithm for maximization of submodular functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q806671)