Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs

arXiv: Data Structures and Algorithms, Volume abs/1606.05198, 2016.

被引用0|浏览28
EI

摘要

We give a general approach to solve various optimization problems on noisy minor-free and bounded treewidth graphs, where some fraction of the edges have been corrupted adversarially. Our results are motivated by a previous work of Magen and Moharrami, who gave a $(1+epsilon)$-approximate estimation algorithm for the independent set probl...更多

代码

数据

下载 PDF 全文
引用
您的评分 :
0

 

标签
评论