Minimizing modular and supermodular functions on L-matroids

zbMATH Open1255.05036MaRDI QIDQ446173FDOQ446173

Authors: Mikhail Yuryevich Vyplov, Victor Petrovich Il'ev, V. A. Baranskii 

Publication date: 5 September 2012

Published in: The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

Recommendations

• On the problem of maximizing a modular function in the geometric lattice
• Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid
• scientific article; zbMATH DE number 4204115
• Supermodular programming on finite lattices
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem

zbMATH Keywords

minimizing a supermodular function on a matroidal structure in the geometric latticeRado-Edmonds theorem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cited In (5)

• On the problem of maximizing a modular function in the geometric lattice
• Rank axiom of modular supermatroids: a connection with directional DR submodular functions
• Decompositions of supermodular functions and \(\square\)-decomposable measures
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Minimizing modular and supermodular functions on \(L\)-matroids

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