Minimum non-submodular cover problem with applications

Majun Shi, Zishen Yang and Wei Wang

Applied Mathematics and Computation, 2021, vol. 410, issue C

Abstract: Minimum Submodular Cover problem often occurs naturally in the context of combinatorial optimization. It is well-known that the greedy algorithm achieves an H(δ)-approximation guarantee for an integer-valued polymatroid potential function f, where δ is the maximum value of f over all singletons and H(δ) is the δ-th harmonic number. In this paper, we extend the setting into the non-submodular potential functions and investigate Minimum Non-submodular Cover problem with integer-valued and fraction-valued potential functions respectively, yielding similar performance results. In addition, we address several real-world applications which can be formulated as Minimum Non-submodular Cover problem.

Keywords: Greedy algorithm; Submodular function; Submodular cover; Approximation ratio (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321005312
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:410:y:2021:i:c:s0096300321005312

DOI: 10.1016/j.amc.2021.126442

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().