Improved Inapproximability For Submodular Maximization

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

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Per Austrin
• Keywords: Approximate, CORR 2010, Education, Submodular Function, Unique Games-hard