使用单一商品流的最稀疏切割近似

ERN: Other Econometrics: Mathematical Methods & Programming (Topic) Pub Date : 2018-09-24 DOI:10.2139/ssrn.3305748

K. A.

{"title":"使用单一商品流的最稀疏切割近似","authors":"K. A.","doi":"10.2139/ssrn.3305748","DOIUrl":null,"url":null,"abstract":"In this paper, we present an algorithm approximating the sparsest cut within a factor of O(log 2 n) in Õ(m + n3/2) time introduced by Khandekar, Rao and Vazirani in. While we explain the theoretical background and prove the claimed approximation factor and runtime, we add new visualization to improve the understandibility.","PeriodicalId":365755,"journal":{"name":"ERN: Other Econometrics: Mathematical Methods & Programming (Topic)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sparsest Cut Approximation Using Single Commodity Flows\",\"authors\":\"K. A.\",\"doi\":\"10.2139/ssrn.3305748\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present an algorithm approximating the sparsest cut within a factor of O(log 2 n) in Õ(m + n3/2) time introduced by Khandekar, Rao and Vazirani in. While we explain the theoretical background and prove the claimed approximation factor and runtime, we add new visualization to improve the understandibility.\",\"PeriodicalId\":365755,\"journal\":{\"name\":\"ERN: Other Econometrics: Mathematical Methods & Programming (Topic)\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ERN: Other Econometrics: Mathematical Methods & Programming (Topic)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.3305748\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ERN: Other Econometrics: Mathematical Methods & Programming (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3305748","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们提出了在Õ(m + n3/2)时间内近似于O(log 2n)因子的最稀疏切割算法。在解释理论背景并证明所声称的近似因子和运行时间的同时，我们增加了新的可视化以提高可理解性。

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

查看原文本刊更多论文

Sparsest Cut Approximation Using Single Commodity Flows

In this paper, we present an algorithm approximating the sparsest cut within a factor of O(log² n) in Õ(m + n^3/2) time introduced by Khandekar, Rao and Vazirani in. While we explain the theoretical background and prove the claimed approximation factor and runtime, we add new visualization to improve the understandibility.

求助全文

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

来源期刊

ERN: Other Econometrics: Mathematical Methods & Programming (Topic)

自引率

0.00%

发文量