Sparsification of Monotone $k$-Submodular Functions of Low Curvature
Data Structures and Algorithms
2023-02-08 v1 Discrete Mathematics
Abstract
Pioneered by Benczur and Karger for cuts in graphs [STOC'96], sparsification is a fundamental topic with wide-ranging applications that has been studied, e.g., for graphs and hypergraphs, in a combinatorial and a spectral setting, and with additive and multiplicate error bounds. Rafiey and Yoshida recently considered sparsification of decomposable submodular functions [AAAI'22]. We extend their work by presenting an efficient algorithm for a sparsifier for monotone -submodular functions of low curvature.
Keywords
Cite
@article{arxiv.2302.03143,
title = {Sparsification of Monotone $k$-Submodular Functions of Low Curvature},
author = {Jannik Kudla and Stanislav Živný},
journal= {arXiv preprint arXiv:2302.03143},
year = {2023}
}