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

DOI10.1016/S0166-218X(01)00318-3zbMATH Open1019.90036MaRDI QIDQ1613409FDOQ1613409

Authors: Kazutoshi Ando 

Publication date: 29 August 2002

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

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

zbMATH Keywords

submodular functionGreedy algorithmlattice polyhedron

Mathematics Subject Classification ID

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

Cites Work

• Geometric algorithms and combinatorial optimization
• Title not available (Why is that?)
• Submodular functions and optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
• On the core of ordered submodular cost games
• Submodular linear programs on forests
• Structural aspects of ordered polymatroids
• A note on Faigle and Kern's dual greedy polyhedra

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
• Extensions of functions of 0-1 variables and applications to combinatorial optimization
• Submodular functions and rooted trees

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)