Approximation algorithm of maximizing non-submodular functions under non-submodular constraint

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED
{"title":"Approximation algorithm of maximizing non-submodular functions under non-submodular constraint","authors":"","doi":"10.1016/j.dam.2024.09.022","DOIUrl":null,"url":null,"abstract":"<div><div>Nowadays, maximizing the non-negative and non-submodular objective functions under Knapsack constraint or Cardinality constraint is deeply researched. Nevertheless, few studies study the objective functions with non-submodularity under the non-submodular constraint. And there are many practical applications of the situations, such as Epidemic transmission, and Sensor Placement and Feature Selection problem. In this paper, we study the maximization of the non-submodular objective functions under the non-submodular constraint. Based on the non-submodular constraint, we discuss the maximization of the objective functions with some specific properties, which includes the property of negative, and then, we obtain the corresponding approximate ratios by the greedy algorithm. What is more, these approximate ratios could be improved when the constraint becomes tight.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X24004128","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

Nowadays, maximizing the non-negative and non-submodular objective functions under Knapsack constraint or Cardinality constraint is deeply researched. Nevertheless, few studies study the objective functions with non-submodularity under the non-submodular constraint. And there are many practical applications of the situations, such as Epidemic transmission, and Sensor Placement and Feature Selection problem. In this paper, we study the maximization of the non-submodular objective functions under the non-submodular constraint. Based on the non-submodular constraint, we discuss the maximization of the objective functions with some specific properties, which includes the property of negative, and then, we obtain the corresponding approximate ratios by the greedy algorithm. What is more, these approximate ratios could be improved when the constraint becomes tight.
非次模化约束条件下的非次模化函数最大化近似算法
如今,在Knapsack约束或Cardinality约束下最大化非负和非次模态目标函数的研究已经非常深入。然而,很少有人研究非次模化约束下的非次模化目标函数。而这种情况在实际应用中很多,如流行病传播、传感器安置和特征选择问题等。本文研究了非次模化约束下的非次模化目标函数最大化问题。基于非次模化约束,我们讨论了目标函数最大化的一些特定属性,其中包括负属性,然后通过贪婪算法得到了相应的近似比率。更重要的是,当约束条件变得严格时,这些近似比率可以得到改善。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Discrete Applied Mathematics
Discrete Applied Mathematics 数学-应用数学
CiteScore
2.30
自引率
9.10%
发文量
422
审稿时长
4.5 months
期刊介绍: The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信