Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

CORR
2010
Springer

favoriteEmaildiscussreport

84views Education» more CORR 2010»

Improved Inapproximability For Submodular Maximization

13 years 3 months ago

Improved Inapproximability For Submodular Maximization

Download www.cs.toronto.edu

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

Per Austrin

Real-time Traffic

Approximate | CORR 2010 | Education | Submodular Function | Unique Games-hard |

claim paper

Related Content

» Symmetry and Approximability of Submodular Maximization Problems

» From query complexity to computational complexity

» Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions

» Submodular Maximization by Simulated Annealing

» On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular We...

» Nonmonotone submodular maximization under matroid and knapsack constraints

» Submodular Maximization over Multiple Matroids via Generalized Exchange Properties

» The Submodular Welfare Problem with Demand Queries

» Improved Inapproximability Results for Maximum kColorable Subgraph

Post Info
More Details (n/a)

Added	25 Dec 2010
Updated	25 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Per Austrin

Comments (0)