论最大无环子图优于随机的优点

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) Pub Date : 2007-10-21 DOI:10.1109/FOCS.2007.47

M. Charikar, K. Makarychev, Yury Makarychev

{"title":"论最大无环子图优于随机的优点","authors":"M. Charikar, K. Makarychev, Yury Makarychev","doi":"10.1109/FOCS.2007.47","DOIUrl":null,"url":null,"abstract":"In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + delta fraction of all edges, our algorithm finds an acyclic subgraph with 1/2 + Omega(delta/ log n) fraction of all edges.","PeriodicalId":197431,"journal":{"name":"48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2007-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":"{\"title\":\"On the Advantage over Random for Maximum Acyclic Subgraph\",\"authors\":\"M. Charikar, K. Makarychev, Yury Makarychev\",\"doi\":\"10.1109/FOCS.2007.47\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + delta fraction of all edges, our algorithm finds an acyclic subgraph with 1/2 + Omega(delta/ log n) fraction of all edges.\",\"PeriodicalId\":197431,\"journal\":{\"name\":\"48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FOCS.2007.47\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FOCS.2007.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 29

摘要

本文提出了一种新的求解最大无环子图问题的近似算法。给定一个实例，其中最大无环子图包含所有边的1/2 + δ分数，我们的算法找到一个所有边的1/2 + ω (δ / log n)分数的无环子图。

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

查看原文本刊更多论文

On the Advantage over Random for Maximum Acyclic Subgraph

In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + delta fraction of all edges, our algorithm finds an acyclic subgraph with 1/2 + Omega(delta/ log n) fraction of all edges.

求助全文

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

来源期刊

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)

自引率

0.00%

发文量