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

submodular functionBoolean cubeShannon-optimum maximum

Mathematics Subject Classification ID

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

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

(12)

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

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)