Maximizing Bisubmodular and k-Submodular Functions

DOI10.1137/1.9781611973402.108zbMath1422.68315OpenAlexW3136549045MaRDI QIDQ5384070

Stanislav Živný, Justin Ward

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973402.108

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (6)

Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms ⋮ Monotone diameter of bisubmodular polyhedra ⋮ Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences ⋮ Weakly \(k\)-submodular maximization under matroid constraint ⋮ Maximizing monotone submodular functions over the integer lattice ⋮ An exact cutting plane method for \(k\)-submodular function maximization

This page was built for publication: Maximizing Bisubmodular and k-Submodular Functions