Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs
arXiv: Data Structures and Algorithms, Volume abs/1606.05198, 2016.
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 全文