EconPapers    
Economics at your fingertips  
 

New approximations for monotone submodular maximization with knapsack constraint

Hongmin W. Du (), Xiang Li () and Guanghua Wang ()
Additional contact information
Hongmin W. Du: Rutgers University
Xiang Li: Santa Clara University
Guanghua Wang: University of Texas at Dallas

Journal of Combinatorial Optimization, 2024, vol. 48, issue 4, No 1, 7 pages

Abstract: Abstract Given a monotone submodular set function with a knapsack constraint, its maximization problem has two types of approximation algorithms with running time $$O(n^2)$$ O ( n 2 ) and $$O(n^5)$$ O ( n 5 ) , respectively. With running time $$O(n^5)$$ O ( n 5 ) , the best performance ratio is $$1-1/e$$ 1 - 1 / e . With running time $$O(n^2)$$ O ( n 2 ) , the well-known performance ratio is $$(1-1/e)/2$$ ( 1 - 1 / e ) / 2 and an improved one is claimed to be $$(1-1/e^2)/2$$ ( 1 - 1 / e 2 ) / 2 recently. In this paper, we design an algorithm with running $$O(n^2)$$ O ( n 2 ) and performance ratio $$1-1/e^{2/3}$$ 1 - 1 / e 2 / 3 , and an algorithm with running time $$O(n^3)$$ O ( n 3 ) and performance ratio 1/2.

Keywords: Approximation algorithm; Submodular maximization; Knapsack (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-024-01214-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:48:y:2024:i:4:d:10.1007_s10878-024-01214-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-024-01214-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:48:y:2024:i:4:d:10.1007_s10878-024-01214-x