Stochastic submodular maximization

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

Volumn 5385 LNCS, Issue , 2008, Pages 477-489

  Asadpour, Arash ^a   Nazerzadeh, Hamid ^a   Saberi, Amin ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE POLICIES; ADAPTIVITY; CAPITAL BUDGETING; CARDINALITY CONSTRAINTS; MAXIMIZATION PROBLEMS; OPTIMAL CONSTANTS; SENSOR PLACEMENTS; SOCIAL NETWORKS; SUBMODULAR;

ADAPTIVE ALGORITHMS; INTERNET; OPTIMIZATION; RANDOM PROCESSES; SENSOR NETWORKS; WINE;

APPROXIMATION ALGORITHMS;

EID: 58849134867     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92185-1_53     Document Type: Conference Paper

References (21)

1. Ageev, A.A., Sviridenko, M.: Pipage rounding: A new method of constructing algorithms with proven performance guarantee. J. Comb. Optim. 8(3), 307-328 (2004)
2. Ahmed, S., Atamtürk, A.: Maximizing a class of submodular utility functions. Research Report BCOL.08.02, IEOR, University of California-Berkeley (March 2008)
3. Chan, C., Farias, V.: Stochastic depletion problems: Effective myopic policies for a class of dynamic optimization problems (manuscript, 2008)
4. Cornuejols, G., Fisher, M., Nemhauser, G.: Location of bank accounts to optimize float. Management Science 23, 789-810 (1977)
5. Dean, B.C., Goemans, M.X., Vondrák, J.: Approximating the stochastic knapsack problem: The benefit of adaptivity. In: FOCS, pp. 208-217 (2004)
6. Feige, U.: A threshold of In for approximating set cover. J. ACM 45(4), 634-652 (1998)
7. Feige, U., Mirrokni, V.S., Vondrák, J.: Maximizing non-monotone submodular functions. In: FOCS, pp. 461-471 (2007)
8. Goemans, M.X., Vondrák, J.: Stochastic covering and adaptivity. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 532-543. Springer, Heidelberg (2006)
9. Kempe, D., Kleinberg, J.M., Tardos, É.: Maximizing the spread of influence through a social network. In: Getoor, L., Senator, T.E., Domingos, P., Faloutsos, C. (eds.) KDD, pp. 137-146. ACM, New York (2003)
10. Kleinberg, J.M., Papadimitriou, C.H., Raghavan, P.: Segmentation problems. J. ACM 51(2), 263-280 (2004)
11. Krause, A., Guestrin, C.: Near-optimal nonmyopic value of information in models. In: AAAI, pp. 324-331 (2005)
12. Krause, A., Guestrin, C.: Near-optimal observation selection using submodular functions. In: AAAI, pp. 1650-1654. AAAI Press, Menlo Park (2007)
13. Mehrez, A., Sinuany-Stern, Z.: Resource allocation to interrelated risky projects using a multiattribute utility function. Management Science (29), 439-490 (1983)
14. Mossel, E., Roch, S.: On the submodularity of influence in social networks. In: Approx, pp. 128-134 (2007)
15. Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of the approximations for maximizing submodular set functions. Mathematical Programming 14, 265-294 (1978)
16. Streeter, M., Golovin, D.: An online algorithm for maximizing submodular functions. Tech Report CMU-CS-07-171 (2008)
17. Topkis, D.M.: Minimizing a submodular function on a lattice. Operations Research 26(2), 305-321 (1978)
18. Vondrák, J.: Submodularity in combinatorial optimization. PhD thesis. Charles University, Prague (2007)
19. Vondrák, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: STOC (2008)
20. Weingartner, H.: Mathematical Programming and the Analysis of Capital Budgeting Problems. Prentice-Hall, Englewood Cliffs (1963)
21. Weingartner, H.: Capital budgeting of interrelated projects: Survey and synthesis. Management Science (1966)