Abstract
Any set function can be decomposed into the difference of two monotone nondecreasing submodular functions. This theorem plays an important role in the set function optimization theory. In this paper, we show a variation that any set function can be decomposed into the difference of two monotone nondecreasing supermodular functions. Meanwhile, we give an example in social network optimization and construct algorithmic solutions for the maximization problem of set functions with this variation of DS decomposition.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chen W, Lin T, Tan Z, Zhao M, Zhou X (2016) Robus influence maximization. In: KDD’16. CA, USA, San Francisco
Du DZ, Ko KI, Hu X (2012) Desin and analysis of approximation algorithms. Springer, Berlin
Grötschel M, Lovász L, Schrijver A (1988) Geometric algorithms and combinatorial optimization, 2nd edn. Springer, Berlin
Gu S, Du H, Thai MT, Du D-Z (2019) Friending. In: Du D-Z, Pardalas PM, Zhang Z (eds) Nonlinear combinatorial optimization. Springer, Berlin, pp 265–272
Iyer R, Bilmes J (2012) Algorithms for approximate minimization of the difference between submodular functions. In: Proceeding of UAI
Kempe D, Kleinberg JM, Tardos E (2003) Maximizing the spread of influence through a social network. KDD, pp 137–146
Lu W, Chen W, Lakshmanan LV S (2016a) From competition to complementarity: comparative influence diffusion and maximization. In: Proceeding the VLDB Endowsment, vol 9, no 2, pp 60–71
Lu Z, Zhang Z, Wu W (2016b) Solution of Bharathi–Kempe–Salek conjecture on influence maximization in arborescence. J Comb Optim 33:803–808
Narasimhan M, Bilmes J (2005) A submodular–supermodular procedure with applications to discriminative structure learning. In: Proceeding of UAI
Orlin JB (2009) A faster strongly polynomial time algorithm for submodular function minimization. Math Program 118:237C251
Schrijver A (2000) A combinatorial algorithm minimizing submodular functions in strong polynomial time. J Comb Theory (B) 80:346–355
Schrijver A, Yannakakis M (1991) Simple local search problems that hard to solve. SIAM J Comput 20(1):56–87
Wang A, Wu W, Cui L (2016) On Bharathi–Kempe–Salek conjecture on influence maximization in arborescence. J Comb Optim 31:1678–1684
Wu WL, Zhang Z, Du DZ (2019) Set function optimization. J Oper Res Soc China 7(2):183–193
Yang DN, Hung HJ, Lee WC, Chen W (2013) Maximizing acceptance probability for active friending in online social networks. KDD, Wei Chen, pp 713–721
Yuan J, Wu W, Li Y, Du D-Z (2017) Active friending in online social networks. In: BDCAT 2017, pp 139–148
Zhang H, Dinh MT, Thai MT (2013) Maximizing the spread of positive inuencein online social networks. In: ICDCS 2013, pp 317–326
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Li, X., Du, H.G. & Pardalos, P.M. A variation of DS decomposition in set function optimization. J Comb Optim 40, 36–44 (2020). https://doi.org/10.1007/s10878-020-00560-w
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-020-00560-w