Document Type
Article
Publication Date
11-2024
Publisher
Springer Nature
Abstract
Given a monotone submodular set function with a knapsack constraint, its maximization problem has two types of approximation algorithms with running time 0(n2) and 0(n5), respectively. With running time 0(n5), the best performance ratio is 1-1/e. With running time 0(n2), the well-known performance ratio is (1-1/e)/2 and an improved one is claimed to be (1-1/e2)/2 recently. In this paper, we design an algorithm with running 0(n2) and performance ratio 1-1/e2/3, and an algorithm with running time 0(n3) and performance ratio 1/2.
Recommended Citation
Du, H. W., Li, X., & Wang, G. (2024). New approximations for monotone submodular maximization with knapsack constraint. Journal of Combinatorial Optimization, 48(4), 28. https://doi.org/10.1007/s10878-024-01214-x
Comments
Open Access - This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.