Maximizing non-monotone submodular functions

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 461-471

  Feige, Uriel ^a   Mirrokni, Vahab S ^b   Vondrák, Jan ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MICROSOFT RESEARCH   (United States)

^c PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

(R ,S)-SYMMETRIC; BLACK BOXES; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; CONSTRAINT SATISFACTION PROBLEM (CSP); FACILITY LOCATION PROBLEMS; GENERAL (CO); HYPERGRAPHS; LOCAL SEARCH (LS); MAX CUT; NP-HARD; ORACLE MODEL; RANDOM SETS; SUBMODULAR FUNCTIONS;

APPROXIMATION THEORY; COMPUTER SCIENCE; FACILITIES; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; FUNCTION EVALUATION; GRAPH THEORY; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; SET THEORY;

APPROXIMATION ALGORITHMS;

EID: 46749125782     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389516     Document Type: Conference Paper

References (36)

1. A. Ageev and M. Sviridenko. An 0.828 approximation algorithm for uncapacitated facility location problem, Discrete Applied Mathematics 93:2-3, (1999) 149-156.
2. P. Alimonti. Non-oblivious Local Search for MAX 2-CCSP with application to MAX DICUT, Proc. of the 23rd International Workshop on Graph-theoretic Concepts in Computer Science (1997).
3. G. Calinescu, C. Chekuri, M. Pal and J. Vondrák. Maximizing a submodular set function subject to a matroid constraint, Proc. of 12th IPCO (2007), 182-196.
4. V. Cherenin. Solving some combinatorial problems of optimal planning by the method of successive calculations, Proc. of the Conference of Experiences and Perspectives of the Applications of Mathematical Methods and Electronic Computers in Planning (in Russian), Mimeograph, Novosibirsk (1962).
5. G. Cornuejols, M. Fischer and G. Nemhauser. Location of bank accounts to optimize float: an analytic study of exact and approximation algorithms, Management Science, 23 (1977), 789-810.
6. G. Cornuejols, M. Fischer and G. Nemhauser. On the uncapacitated location problem, Annals of Discrete Math 1 (1977), 163-178.
7. G. P. Cornuejols, G. L. Nemhauser and L. A. Wolsey. The uncapacitated facility location problem, Discrete Location Theory (1990), 119-171.
8. J. Edmonds. Matroids, submodular functions and certain polyhedra, Combinatorial Structures and Their Applications (1970), 69-87.
9. U. Feige and M. X. Goemans. Approximating the value of two-prover systems, with applications to MAX-2SAT and MAX-DICUT, Proc. of the 3rd Israel Symposium on Theory and Computing Systems, Tel Aviv (1995), 182-189.
10. U. Feige. A threshold of ln n for approximating Set Cover, Journal of the ACM 45 (1998), 634-652.
11. U. Feige. Maximizing social welfare when utility functions are subadditive, Proc. of 38th STOC (2006), 41-50.
12. U. Feige and J. Vondrák. Approximation algorithms for combinatorial allocation problems: Improving the factor of 1 - 1/e, Proc. of 47th FOCS (2006), 667-676.
13. S. Fujishige. Canonical decompositions of symmetric submodular systems, Discrete Applied Mathematics 5 (1983), 175-190.
14. L. Fleischer, S. Fujishige and S. Iwata. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions, Journal of the ACM 48:4 (2001), 761-777.
15. A. Frank. Matroids and submodular functions, Annotated Biblographies in Combinatorial Optimization (1997), 65-80.
16. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM 42 (1995), 1115-1145.
17. B. Goldengorin, G. Sierksma, G. Tijsssen and M. Tso. The data correcting algorithm for the minimization of supermodular functions, Management Science, 45:11 (1999), 1539-1551.
18. B. Goldengorin, G. Tijsssen and M. Tso. The maximization of submodular functions: Old and new proofs for the correctness of the dichotomy algorithm, SOM Report, University of Groningen (1999).
19. V. Guruswami. Inapproximability results for set splitting and satisfiability problems with no mixed clauses, Algorithmica 38 (2004), 451-469.
20. V. Guruswami and S. Khot. Hardness of Max 3-SAT with no mixed clauses, Proc. of 20th IEEE Conference on Computational Complexity (2005), 154-162.
21. E. Halperin and U. Zwick. Combinatorial approximation algorithms for the maximum directed cut problem, Proc. of 12th SODA (2001), 1-7.
22. J. Håstad. Some optimal inapproximability results, Journal of the ACM 48 (2001), 798-869.
23. V. R. Khachaturov. Mathematical methods of regional programming (in Russian), Nauka, Moscow (1989).
24. S. Khot, G. Kindler, E. Mossel and R. O'Donnell. Optimal inapproximability results for MAX-CUT and other two-variable CSPs? Proc. of 45th FOCS (2004), 146-154.
25. D. Livnat, M. Lewin and U. Zwick. Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. Proc. of 9th IPCO (2002), 67-82.
26. H. Lee, G. Nemhauser and Y. Wang. Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case, European Journal of Operational Research 94, 154-166.
27. L. Lovász. Submodular functions and convexity. A. Bachern et al., editors, Mathematical Programmming: The State of the Art, 235-257.
28. M. Minoux. Accelerated greedy algorithms for maximizing submodular functions, J. Stoer, ed., Actes Congress IFIP, Springer Verlag, Berlin (1977), 234-243.
29. E. Mossel, R. O'Donnell and K. Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality, Proc. of 46th FOCS (2005), 21-30.
30. G. L. Nemhauser, L. A. Wolsey and M. L. Fisher. An analysis of approximations for maximizing submodular set functions I, Mathematical Programming 14 (1978), 265-294.
31. G. L. Nemhauser, L. A. Wolsey and M. L. Fisher. An analysis of approximations for maximizing submodular set functions II, Mathematical Programming Study 8 (1978), 73-87.
32. T. Robertazzi and S. Schwartz. An accelated sequential algorithm for producing D-optimal designs, SIAM Journal on Scientific and Statistical Computing 10, 341-359.
33. M. Queyranne. A combinatorial algorithm for minimizing symmetric submodular functions, Proc. of 6th SODA (1995), 98-101.
34. A. Schäfer and M. Yannakakis. Simple local search problems that are hard to solve, SIAM J. Comput. 20:1 (1991), 56-87.
35. A. Schrijver. A combinatorial algorithm minimizing submodular functions in strongly polynomial time, Journal of Combinatorial Theory, Series B 80 (2000), 346-355.
36. M. Sviridenko. A note on maximizing a submodular set function subject to a knapsack constraint, Operations Research Letters 32 (2004), 41-43.