Submodular function maximization on the bounded integer lattice

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

Volumn 9499, Issue , 2015, Pages 133-144

  Gottschalk, Corinna ^a   Peis, Britta ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY;

INTEGER LATTICE; STRUCTURAL DIFFERENCES; SUBMODULAR; SUBMODULAR FUNCTIONS; SUBMODULAR SET FUNCTIONS;

APPROXIMATION ALGORITHMS;

EID: 84956698989     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-28684-6_12     Document Type: Conference Paper

References (16)

1. Bolandnazar, M., Huh, W., McCormick, S., Murota, K.: A note on “order-based cost optimization in assemble-to-order systems”. University of Tokyo February, Techical report (2015)
2. Buchbinder, N., Feldmann, M., Naor, J., Schwartz, R.: A tight linear (1/2)- approximation for unconstrained submodular maximization. In: FOCS pp. 649–658 (2012)
3. Buchbinder, N., Feldman, M.: Deterministic algorithms for submodular maximization problems. CoRR (2015). abs/1505.02695
4. Calinescu, G., Chekuri, C., Pál, M., Vondrák, J.: Maximizing a submodular set function subject to a matroid constraint (extended abstract). In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 182–196. Springer, Heidelberg (2007)
5. Feige, M.: Vondrák: Maximizing Non-Monotone Submodular Functions. SIAM Journal on Computing 40(4), 1133–1153 (2011)
6. Feldman, M., Naor, J.S., Schwartz, R.: Nonmonotone submodular maximization via a structural continuous greedy algorithm. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 342–353. Springer, Heidelberg (2011)
7. Fujishige, S.: Submodular Functions and Optimization. Annals of Discrete Mathematics, vol. 58, 2nd edn, pp. 305–308. Elsevier, New York (2005)
8. Goldengorin, B., Tijssen, G., Tso, M.: The maximization of submodular functions: old and new proofs for the correctness of the dichotomy algorithm. Technical report 99A17, University of Groningenm Research Institute SOM (1999)
9. Golovin, D., Krause, A.: Submodular function maximization. In: Bordeaux, L., Hamadi, Y., Kohli, P. (eds.) Tractability: Practical Approaches to Hard Problems. Cambridge University Press, Cambridge (2014)
10. Grabisch, M., Xie, L.: The restricted core of games on distributive lattices: how to share benefits in a hierarchy. Math. Methods Oper. Res. 73, 189–208 (2011)
11. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)
12. Inaba, K., Kakimura, N. K. K., Soma, T.: Optimal budget allocation: Theoretical guarantee and efficient algorithm. In: Proceedings of the 31st International Conference on Machine Learning, pp. 351–359 (2014). JMLR.org
13. Murota, K.: Submodular function minimization and maximization in discrete convex analysis. RIMS Kokyuroku Bessatsu B23, 193–211 (2010)
14. Oveis Gharan, S., Vondrák, J.: Submodular maximization by simulated annealing. In: SODA, pp. 1098–1117 (2011)
15. Schulz, A., Uhan, N.: Approximating the least core value and least core of cooperative games with supermodular costs. Discrete Optim. 10(2), 163–180 (2013)
16. Soma, T., Yoshida, Y.: Maximizing submodular functions with the diminishing return property over the integer lattice. CoRR 2015. abs/1503.01218