Abstract
We show that it is Unique Games-hard to approximate the maximum of a submodular function to within a factor 0.695, and that it is Unique Games-hard to approximate the maximum of a symmetric submodular function to within a factor 0.739. These results slightly improve previous results by Feige, Mirrokni and Vondrák (FOCS 2007) who showed that these problems are NP-hard to approximate to within 3/4+ε≈0.750 and 5/6+ε≈0.833, respectively. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Austrin, P. (2010). Improved inapproximability for submodular maximization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6302 LNCS, pp. 12–24). https://doi.org/10.1007/978-3-642-15369-3_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
