Improved inapproximability for submodular maximization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6302 LNCS, Issue , 2010, Pages 12-24

  Austrin, Per ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149287616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15369-3_2     Document Type: Conference Paper

References (10)

1. Austrin, P.: Improved Inapproximability For Submodular Maximization. arXiv:1004.3777v1 [cs.CC] (2010)
2. Austrin, P., Mossel, E.: Approximation Resistant Predicates from Pairwise Independence. Computational Complexity 18(2), 249-271 (2009)
3. Feige, U., Mirrokni, V.S., Vondrák, J.: Maximizing non-monotone submodular functions. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 461-471 (2007)
4. Goemans, M.X., Williamson, D.P.: Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. Journal of the ACM 42, 1115-1145 (1995)
5. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169-197 (1981)
6. Khot, S.: On the Power of Unique 2-prover 1-round Games. In: ACM Symposium on Theory of Computing (STOC), pp. 767-775 (2002)
7. Lovász, L.: Submodular functions and convexity. In: Grötschel, M., Bachem, A., Korte, B. (eds.) Mathematical Programming: The State of the Art - Bonn 1982, pp. 235-257. Springer, Heidelberg (1983)
8. Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-I. Mathematical Programming 14, 265-294 (1978)
9. Vondrák, J.: Submodular maximization by simulated annealing. Unpublished manuscript
10. Vondrák, J.: Submodularity in Combinatorial Optimization. PhD thesis, Charles University (2007)