K-submodular functions and convexity of their Lovász extension

DOI10.1016/S0166-218X(01)00318-3MaRDI QIDQ1613409zbMATH OpenFDO

Authors Kazutoshi Ando

Publication date 29 August 2002

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

submodular functionGreedy algorithmlattice polyhedron

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Towards minimizing \(k\)-submodular functions
• scientific article; zbMATH DE number 3904328
• On the subdifferential of a submodular function
• A greedy algorithm for convex geometries
• scientific article; zbMATH DE number 1953186

Cites work

• scientific article; zbMATH DE number 3862931 (Why is no real title available?)
• scientific article; zbMATH DE number 3904328 (Why is no real title available?)
• scientific article; zbMATH DE number 3634269 (Why is no real title available?)
• A note on Faigle and Kern's dual greedy polyhedra
• An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
• Geometric algorithms and combinatorial optimization
• On the core of ordered submodular cost games
• Structural aspects of ordered polymatroids
• Submodular functions and optimization
• Submodular linear programs on forests

Cited in

(5)

• A greedy algorithm for convex geometries
• A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract)
• Dual greedy polyhedra, choice functions, and abstract convex geometries
• Submodular functions and rooted trees
• Extensions of functions of 0-1 variables and applications to combinatorial optimization

This page was built for publication: K-submodular functions and convexity of their Lovász extension

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