半流模型中最大权值匹配的A (2+ε)-近似

ACM Transactions on Algorithms (TALG) Pub Date : 2018-12-07 DOI:10.1145/3274668

A. Paz, Gregory Schwartzman

{"title":"半流模型中最大权值匹配的A (2+ε)-近似","authors":"A. Paz, Gregory Schwartzman","doi":"10.1145/3274668","DOIUrl":null,"url":null,"abstract":"We present a simple deterministic single-pass (2+ε)-approximation algorithm for the maximum weight matching problem in the semi-streaming model. This improves on the currently best known approximation ratio of (4+ε). Our algorithm uses O(nlog2 n) bits of space for constant values of ε. It relies on a variation of the local-ratio theorem, which may be of use for other algorithms in the semi-streaming model as well.","PeriodicalId":154047,"journal":{"name":"ACM Transactions on Algorithms (TALG)","volume":"293 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A (2+ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model\",\"authors\":\"A. Paz, Gregory Schwartzman\",\"doi\":\"10.1145/3274668\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a simple deterministic single-pass (2+ε)-approximation algorithm for the maximum weight matching problem in the semi-streaming model. This improves on the currently best known approximation ratio of (4+ε). Our algorithm uses O(nlog2 n) bits of space for constant values of ε. It relies on a variation of the local-ratio theorem, which may be of use for other algorithms in the semi-streaming model as well.\",\"PeriodicalId\":154047,\"journal\":{\"name\":\"ACM Transactions on Algorithms (TALG)\",\"volume\":\"293 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Algorithms (TALG)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3274668\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Algorithms (TALG)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3274668","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

针对半流模型中的最大权值匹配问题，提出了一种简单的确定性单次(2+ε)近似算法。这改进了目前最著名的近似比(4+ε)。我们的算法使用O(nlog2 n)位空间来表示ε的常数值。它依赖于局部比定理的一种变体，这可能也适用于半流模型中的其他算法。

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

查看原文

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

本刊更多论文

A (2+ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model

We present a simple deterministic single-pass (2+ε)-approximation algorithm for the maximum weight matching problem in the semi-streaming model. This improves on the currently best known approximation ratio of (4+ε). Our algorithm uses O(nlog2 n) bits of space for constant values of ε. It relies on a variation of the local-ratio theorem, which may be of use for other algorithms in the semi-streaming model as well.

求助全文

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

来源期刊

ACM Transactions on Algorithms (TALG)

自引率

0.00%

发文量

期刊最新文献

Generic Techniques for Building Top-k Structures Deterministic Leader Election in Anonymous Radio Networks A Learned Approach to Design Compressed Rank/Select Data Structures k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms Fully Dynamic (Δ +1)-Coloring in O(1) Update Time