LP-based robust algorithms for noisy minor-free and bounded treewidth graphs

SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, pp. 1964-1979, 2017.

Cited by: 11|Views22
EI

Abstract:

We give a general approach for solving optimization problems on noisy minor free and bounded treewidth graphs, where a fraction of edges are adversarially corrupted. The noisy setting was first considered by Magen and Moharrami and they gave a (1 + ϵ)-estimation algorithm for the independent set problem. Later, Chan and Har-Peled designed...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments