School of Mathematics and Statistics, Shandong Normal University, Jinan 250014, China
Show Author Information
Hide Author Information
Abstract
A -submodular function is a generalization of a submodular function, its definition domain is extended from the collection of single subsets to the collection of disjoint subsets. The -submodular maximization problem has a wide range of applications. In this paper, we propose a nested greedy and local search algorithm for the problem of maximizing a monotone -submodular function subject to a knapsack constraint and matroid constraints.
No abstract is available for this article. Click the button above to view the PDF directly.
References
[1]
G. L.Nemhauser, L. A.Wolsey, and M. L.Fisher, An analysis of approximations for maximizing submodular set functions-I, Math. Program., vol. 14, no. 1, pp. 265–294, 1978.
A.Ene and H. L.Nguyên, A nearly-linear time algorithm for submodular maximization with a knapsack constraint, in Proc. 46th Int. Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, pp. 53:1–53:12.
G.Calinescu, C.Chekuri, M.Pál, and J.Vondrák, Maximizing a monotone submodular function subject to a matroid constraint, SIAM J. Comput., vol. 40, no. 6, pp. 1740–1766, 2011.
Y.Filmus and J.Ward, Monotone submodular maximization over a matroid via non-oblivious local search, SIAM J. Comput., vol. 43, no. 2, pp. 514–542, 2014.
K. K.Sarpatwar, B.Schieber, and H.Shachnai, Constrained submodular maximization via greedy local search, Oper. Res. Lett., vol. 47, no. 1, pp. 1–6, 2019.
A. A.Bian, J. M.Buhmann, A.Krause, and S.Tschiatschek, Guarantees for greedy maximization of non-submodular functions with applications, in Proc. 34th Int. Conf. Machine Learning, Sydney, Australia, 2017, pp. 498–507.
C. C.Huang, N.Kakimura, S.Mauras, and Y.Yoshida, Approximability of monotone submodular function maximization under cardinality and matroid constraints in the streaming model, SIAM J. Discrete Math., vol. 36, no. 1, pp. 355–382, 2022.
Z. C.Liu, L. K.Guo, D. L.Du, D. C.Xu, and X. Y.Zhang, Maximization problems of balancing submodular relevance and supermodular diversity, J. Glob. Optim., vol. 82, no. 1, pp. 179–194, 2022.
Y.Yoshida, Maximizing a monotone submodular function with a bounded curvature under a knapsack constraint, SIAMJ. Discrete Math., vol. 33, no. 3, pp. 1452–1471, 2019.
N.Ohsaka and Y.Yoshida, Monotone -submodular function maximization with size constraints, in Proc. 28th Int. Conf. Neural Information Processing Systems, Montreal, Canada, 2015, pp. 694–702.
A.Rafiey and Y.Yoshida. Fast and private submodular and -submodular functions maximization with matroid constraints, in Proc. 37th Int. Conf. Machine Learning, Virtual event, 2020, p. 731, 2020.
S.Iwata, S. I.Tanigawa, and Y.Yoshida, Improved approximation algorithms for -submodular function maximization, in Proc. 27th Ann. ACM-SIAM Symp. Discrete Algorithms, Arlington, VA, USA, 2016, pp. 404–413.
Z. Z.Tang, C. H.Wang, and H.Chan, On maximizing a monotone -submodular function under a knapsack constraint, Oper. Res. Lett., vol. 50, no. 1, pp. 28–31, 2022.
Liu Q, Yu K, Li M, et al. k-Submodular Maximization with a Knapsack Constraint and p Matroid Constraints. Tsinghua Science and Technology, 2023, 28(5): 896-905. https://doi.org/10.26599/TST.2022.9010039
The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).