Algorithms for maximizing monotone submodular function minus modular function under noise

Shufang Gong, Bin Liu (), Mengxue Geng and Qizhi Fang
Additional contact information
Shufang Gong: Ocean University of China
Bin Liu: Ocean University of China
Mengxue Geng: Ocean University of China
Qizhi Fang: Ocean University of China

Journal of Combinatorial Optimization, 2023, vol. 45, issue 4, No 1, 18 pages

Abstract: Abstract Submodular function has the property of diminishing marginal gain, and thus it has a wide range of applications in combinatorial optimization and in emerging disciplines such as machine learning and artificial intelligence. For any set S, most of previous works usually do not consider how to compute f(S) , but assume that there exists an oracle that will output f(S) directly. In reality, however, the process of computing the exact f is often inevitably inaccurate or costly. At this point, we adopt the easily available noise version F of f. In this paper, we investigate the problems of maximizing a non-negative monotone normalized submodular function minus a non-negative modular function under the $$\varepsilon $$ ε -multiplicative noise in three situations, i.e., the cardinality constraint, the matroid constraint and the online unconstraint. For the above problems, we design three deterministic bicriteria approximation algorithms using greedy and threshold ideas and furthermore obtain good approximation guarantees.

Keywords: Submodular minus modular; Multiplicative noise; Bicriteria algorithm; Cardinality constraint; Matroid constraint (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01026-5 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:45:y:2023:i:4:d:10.1007_s10878-023-01026-5

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

DOI: 10.1007/s10878-023-01026-5

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 ().