LP-based robust algorithms for noisy minor-free and bounded treewidth graphs
From MaRDI portal
Abstract: We give a general approach for solving optimization problems on noisy minor free graphs, where a delta-fraction of edges and vertices are adversarially corrupted. The noisy setting was first considered by Magen and Moharrami and they gave a (1 + delta)-estimation algorithm for the independent set problem. Later, Chan and Har-Peled designed a local search algorithm that finds a (1 + O(delta))-approximate independent set. However, nothing was known regarding other problems in the noisy setting. Our main contribution is a general LP-based framework that yields a (1 + O(delta log m log log m))-approximation algorithm for noisy MAX-k-CSPs on m clauses.
Recommendations
- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
- Approximating independent set in perturbed graphs
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
- Algorithms and Computation
- Simple PTAS's for families of graphs excluding a minor
Cited in
(6)- The robustness of LWPP and WPP, with an application to graph reconstruction
- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
- Bilu-Linial stability, certified algorithms and the independent set problem
- Covering vectors by spaces in perturbed graphic matroids and their duals
- A constant-factor approximation for weighted bond cover
This page was built for publication: LP-based robust algorithms for noisy minor-free and bounded treewidth graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575875)
