Submodular maximization by simulated annealing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 1098-1116

  Gharan, Shayan Oveis ^a   Vondrák, Jan ^b  

^a STANFORD UNIVERSITY   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; SIMULATED ANNEALING;

CARDINALITY CONSTRAINTS; CONSTANT FACTOR APPROXIMATION; DISJOINT BASIS; NON NEGATIVES; ORACLE MODEL; SUBMODULAR; SUBMODULAR SET FUNCTIONS; UNCONSTRAINED PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 79955724706     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.83     Document Type: Conference Paper

References (33)

1. P. Austrin. Improved inapproximability for submodular maximization, Proc. of APPROX 2010, 12-24.
2. D. Bertsimas and J. Tsitsiklis. Simulated annealing, Statistical Science 8:1 (1993), 10-15.
3. I. Bezáková, D. Štefankovič, V. Vazirani and E. Vigoda. Accelerating simulated annealing for the permanent and combinatorial counting problems. SIA M Journal of Computing 37:5 (2008), 1429-1454.
4. G. Calinescu, C. Chekuri, M. Pál and J. Vondrák. Maximizing a subinodular set function subject to a matroid constraint, Proc. of 12th IPCO (2007), 182-196.
5. G. Calinescu, C. Chekuri, M. Pál and J. Vondrák. Maximizing a submodular set function subject to a matroid constraint, to appear in SIAM J. on Computing.
6. th IEEE FOCS (2010).
7. U. Feige. A threshold of Inn for approximating Set Cover, Journal of the ACM 45(1998), 634-652. (Pubitemid 128488790)
8. 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.
9. th IEEE FOCS (2007), 461-471.
10. M. L. Fisher, G. L. Nemhauser and L. A. Wolsey. An analysis of approximations for maximizing submodular set functions II, Mathematical Programming Study 8 (1978), 73-87.
11. 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.
12. th IEEE FOCS (2009), 755-764.
13. 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.
14. B. Goldengorin, G. Sierksma, G. Tijsssen and M. Tso. The data correcting algorithm for the minimization of supennodular functions, Management Science, 45:11 (1999), 1539-1551. (Pubitemid 30523645)
15. 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).
16. M. Grötschel, L. Lovász and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1:2 (1981), 169-197.
17. A. Gupta, A. Roth, G. Schoenebeck and K. Talwar. Constrained non-monotone submodular maximization: offline and secretary algorithms, manuscript, 2010.
18. S. Iwata and K. Nagano. Submodular function minimization under covering constraints, In Proc. of 50th IEEE FOCS (2009), 671-680.
19. A. T. Kalai and S Vempala. Simulated annealing for convex optimization, Math, of Operations Research, 31:2 (2006), 253-266. (Pubitemid 44343590)
20. V. R. Khachaturov. Mathematical methods of regional programming (in Russian), Nauka, Moscow, 1989.
21. th ACM-SIAM SODA (2009), 545-554.
22. st ACM STOC (2009), 323-332.
23. J. Lee, M. Sviridenko and J. Vondrák. Submodular maximization over multiple matroids via generalized exchange properties, Proc. of APPROX 2009, 244-257.
24. 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 (1996), 154-166. (Pubitemid 126390437)
25. L. Lovász. Submodular functions and convexity. A. Bachem et al., editors, Mathematical Programmmmg: The State of the Art, 1983, 235-257.
26. th IEEE FOCS (2003), 650-659.
27. T. Robertazzi and S. Schwartz. An accelated sequential algorithm for producing D-optiinal designs, SIAM Journal on Scientific and Statistical Computing 10 (1989), 341-359.
28. A. Schrijver. A combinatorial algorithm minimizing submodular functions in strongly polynomial time, Journal of Combinatorial Theory, Series B 80 (2000), 346-355.
29. A. Schrijver. Combinatorial optimization - polyhedra and efficiency. Springer, 2003.
30. Z. Svitkina and L. Fleischer. Submodular approximation: Sampling-based algorithms and lower bounds, Proc. of 49th IEEE FOCS (2008), 697-706.
31. D. Štefankovič, S. Vempala and E. Vigoda. Adaptive simulated annealing: a near-optimal connection between sampling and counting, Journal of the ACM 56:3 (2009), 1-36.
32. th ACM STOC (2008), 67-74.
33. th IEEE FOCS (2009), 651-670.