遗忘可以让你更快:一个O*(8.097k)时间的加权3集k-包装算法

IF 0.8 Q3 COMPUTER SCIENCE, THEORY & METHODS
M. Zehavi
{"title":"遗忘可以让你更快:一个O*(8.097k)时间的加权3集k-包装算法","authors":"M. Zehavi","doi":"10.1145/3599722","DOIUrl":null,"url":null,"abstract":"In this paper, we study the classic Weighted 3-Set k-Packing problem: given a universe U, a family \\(\\mathcal {S} \\) of subsets of size 3 of U, a weight function \\(w : {\\mathcal {S}} \\rightarrow \\mathbb {R} \\) , \\(W \\in \\mathbb {R} \\) and a parameter \\(k \\in \\mathbb {N} \\) , the objective is to decide if there is a subfamily \\({\\mathcal {S}}^{\\prime } \\subseteq {\\mathcal {S}} \\) of k disjoint sets and total weight at least W. We present a deterministic parameterized algorithm for this problem that runs in time O*(8.097k), where O* hides factors polynomial in the input size. This substantially improves upon the previously best deterministic algorithm for Weighted 3-Set k-Packing, which runs in time O*(12.155k) [SIDMA 2015], and was also the best deterministic algorithm for the unweighted version of this problem. Our algorithm is based on a novel application of the method of representative sets that might be of independent interest.","PeriodicalId":44045,"journal":{"name":"ACM Transactions on Computation Theory","volume":"1 1","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2023-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Forgetfulness Can Make You Faster: An O*(8.097k)-Time Algorithm for Weighted 3-Set k-Packing\",\"authors\":\"M. Zehavi\",\"doi\":\"10.1145/3599722\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the classic Weighted 3-Set k-Packing problem: given a universe U, a family \\\\(\\\\mathcal {S} \\\\) of subsets of size 3 of U, a weight function \\\\(w : {\\\\mathcal {S}} \\\\rightarrow \\\\mathbb {R} \\\\) , \\\\(W \\\\in \\\\mathbb {R} \\\\) and a parameter \\\\(k \\\\in \\\\mathbb {N} \\\\) , the objective is to decide if there is a subfamily \\\\({\\\\mathcal {S}}^{\\\\prime } \\\\subseteq {\\\\mathcal {S}} \\\\) of k disjoint sets and total weight at least W. We present a deterministic parameterized algorithm for this problem that runs in time O*(8.097k), where O* hides factors polynomial in the input size. This substantially improves upon the previously best deterministic algorithm for Weighted 3-Set k-Packing, which runs in time O*(12.155k) [SIDMA 2015], and was also the best deterministic algorithm for the unweighted version of this problem. Our algorithm is based on a novel application of the method of representative sets that might be of independent interest.\",\"PeriodicalId\":44045,\"journal\":{\"name\":\"ACM Transactions on Computation Theory\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2023-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Computation Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3599722\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Computation Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3599722","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了经典的加权3集k- packing问题:给定一个域U,一个U的大小为3的子集族\(\mathcal {S} \),一个权函数\(w : {\mathcal {S}} \rightarrow \mathbb {R} \), \(W \in \mathbb {R} \)和一个参数\(k \in \mathbb {N} \),目的是确定是否存在k个不相交集的子族\({\mathcal {S}}^{\prime } \subseteq {\mathcal {S}} \),并且总权值至少为w。我们给出了一个确定性参数化算法,该算法运行时间为O*(8.097k),其中O*隐藏了输入大小中的因子多项式。这大大改进了之前加权3集k-Packing的最佳确定性算法,该算法运行时间为O*(12.155k) [SIDMA 2015],也是该问题的非加权版本的最佳确定性算法。我们的算法是基于代表集方法的一种新的应用,这可能是独立的兴趣。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Forgetfulness Can Make You Faster: An O*(8.097k)-Time Algorithm for Weighted 3-Set k-Packing
In this paper, we study the classic Weighted 3-Set k-Packing problem: given a universe U, a family \(\mathcal {S} \) of subsets of size 3 of U, a weight function \(w : {\mathcal {S}} \rightarrow \mathbb {R} \) , \(W \in \mathbb {R} \) and a parameter \(k \in \mathbb {N} \) , the objective is to decide if there is a subfamily \({\mathcal {S}}^{\prime } \subseteq {\mathcal {S}} \) of k disjoint sets and total weight at least W. We present a deterministic parameterized algorithm for this problem that runs in time O*(8.097k), where O* hides factors polynomial in the input size. This substantially improves upon the previously best deterministic algorithm for Weighted 3-Set k-Packing, which runs in time O*(12.155k) [SIDMA 2015], and was also the best deterministic algorithm for the unweighted version of this problem. Our algorithm is based on a novel application of the method of representative sets that might be of independent interest.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
ACM Transactions on Computation Theory
ACM Transactions on Computation Theory COMPUTER SCIENCE, THEORY & METHODS-
CiteScore
2.30
自引率
0.00%
发文量
10
×
引用
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学术官方微信