Finding Submodularity Hidden in Symmetric Difference

DOI10.1137/19M1243361zbMath1431.90136arXiv1712.08721OpenAlexW3010283297MaRDI QIDQ5218436

Junpei Nakashima, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita

Publication date: 4 March 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.08721

zbMATH Keywords

submodular functionssymmetric difference

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Convex functions and convex programs in convex geometry (52A41) Convexity of real functions of several variables, generalizations (26B25)

Related Items (1)

Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on submodular function minimization with covering type linear constraints
• Minimizing symmetric submodular functions
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A note on submodular function minimization by Chubanov's LP algorithm
• Submodular functions and optimization.
• Maximizing Non-monotone Submodular Functions
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• The Partial Order of a Polymatroid Extreme Point
• An analysis of approximations for maximizing submodular set functions—I
• Discrete Convex Analysis
• Learning with Submodular Functions: A Convex Optimization Perspective
• Convex Analysis

This page was built for publication: Finding Submodularity Hidden in Symmetric Difference