具有亚模态惩罚的容错设施位置问题的近似计算算法

IF 0.9 4区数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Journal of Combinatorial Optimization Pub Date : 2024-02-26 DOI:10.1007/s10878-024-01106-0

Yingying Guo, Qiaoliang Li

{"title":"具有亚模态惩罚的容错设施位置问题的近似计算算法","authors":"Yingying Guo, Qiaoliang Li","doi":"10.1007/s10878-024-01106-0","DOIUrl":null,"url":null,"abstract":"This work is to discuss the fault-tolerant facility location problem with submodular penalties. We propose an LP-rounding 2.27-approximation algorithm, where every demand point j has a requirement that \\(t_{j}\\) distinct facilities serve it. This is the first constant performance guarantee known for this problem. In addition, we give an LP-rounding 2-approximation algorithm for the case where all requirements are the same.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"27 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximation algorithms for the fault-tolerant facility location problem with submodular penalties\",\"authors\":\"Yingying Guo, Qiaoliang Li\",\"doi\":\"10.1007/s10878-024-01106-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work is to discuss the fault-tolerant facility location problem with submodular penalties. We propose an LP-rounding 2.27-approximation algorithm, where every demand point j has a requirement that \\\\(t_{j}\\\\) distinct facilities serve it. This is the first constant performance guarantee known for this problem. In addition, we give an LP-rounding 2-approximation algorithm for the case where all requirements are the same.\",\"PeriodicalId\":50231,\"journal\":{\"name\":\"Journal of Combinatorial Optimization\",\"volume\":\"27 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-02-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10878-024-01106-0\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-024-01106-0","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

摘要

这项工作旨在讨论具有亚模态惩罚的容错设施定位问题。我们提出了一种 LP-rounding 2.27 近似算法，其中每个需求点 j 都要求有 \(t_{j}\) 个不同的设施为其服务。这是该问题已知的第一个恒定性能保证。此外，我们还给出了所有要求相同情况下的 LP-rounding 2-approximation 算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Approximation algorithms for the fault-tolerant facility location problem with submodular penalties

This work is to discuss the fault-tolerant facility location problem with submodular penalties. We propose an LP-rounding 2.27-approximation algorithm, where every demand point j has a requirement that \(t_{j}\) distinct facilities serve it. This is the first constant performance guarantee known for this problem. In addition, we give an LP-rounding 2-approximation algorithm for the case where all requirements are the same.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Combinatorial Optimization 数学-计算机：跨学科应用

CiteScore

2.00

自引率

10.00%

发文量

审稿时长

6 months

期刊介绍： The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.