Abstract
Motivated by the practical applications in solving plenty of important combinatorial optimization problems, this paper investigates the Budgeted k-Submodular Maximization problem defined as follows: Given a finite set V, a budget B and a k-submodular function \(f: (k+1)^V \mapsto \mathbb {R}_+\), the problem asks to find a solution \(\mathbf{s }=(S_1, S_2, \ldots , S_k) \in (k+1)^V \), in which an element \(e \in V\) has a cost \(c_i(e)\) when added into the i-th set \(S_i\), with the total cost of \(\mathbf{s }\) that does not exceed B so that \(f(\mathbf{s })\) is maximized. To address this problem, we propose two single pass streaming algorithms with approximation guarantees: one for the case that an element e has only one cost value when added to all i-th sets and one for the general case with different values of \(c_i(e)\). We further investigate the performance of our algorithms in two applications of the problem, Influence Maximization with k topics and sensor placement of k types of measures. The experiment results indicate that our algorithms can return competitive results but require fewer the number of queries and running time than the state-of-the-art methods.
Similar content being viewed by others
References
Badanidiyuru A, Vondrák J (2014) Fast algorithms for maximizing submodular functions. In: Chekuri C (ed) Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, Oregon, USA, January 5–7, 2014, SIAM, pp 1497–1514. https://doi.org/10.1137/1.9781611973402.110
Badanidiyuru A, Mirzasoleiman B, Karbasi A, Krause A (2014) Streaming submodular maximization: massive data summarization on the fly. In: Macskassy SA, Perlich C, Leskovec J, Wang W, Ghani R (eds) The 20th ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’14, New York, NY, USA—August 24–27, 2014, ACM, pp 671–680
Bodik P, Hong W, Guestrin C, Madden S, Paskin M, Thibaux R (2004) Intel lab. http://db.csail.mit.edu/labdata/labdata.html
Borgs C, Brautbar M, Chayes JT, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, Oregon, USA, January 5–7, 2014, pp 946–957
Buchbinder N, Feldman M, Naor J, Schwartz R (2015) A tight linear time (1/2)-approximation for unconstrained submodular maximization. SIAM J Comput 44(5):1384–1402
Călinescu G, Chekuri C, Pál M, Vondrák J (2011) Maximizing a monotone submodular function subject to a matroid constraint. SIAM J Comput 40(6):1740–1766
Chakrabarti A, Kale S (2015) Submodular maximization meets streaming: matchings, matroids, and more. Math Program 154(1–2):225–247
Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: ICDM 2010, The 10th IEEE international conference on data mining, Sydney, Australia, 14–17 December 2010, pp 88–97
Gomes R, Krause A (2010) Budgeted nonparametric learning from data streams. In: Fürnkranz J, Joachims T (eds) Proceedings of the 27th international conference on machine learning (ICML-10), June 21–24, 2010, Haifa, Israel, Omnipress, pp 391–398
Haba R, Kazemi E, Feldman M, Karbasi A (2020) Streaming submodular maximization under a k-set system constraint. In: Proceedings of the 37th international conference on machine learning, ICML 2020, 2020, virtual event, PMLR, proceedings of machine learning research, vol 119, pp 3939–3949
Huang C, Kakimura N, Yoshida Y (2020) Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. Algorithmica 82(4):1006–1032
Iwata S, Tanigawa S, Yoshida Y (2016) Improved approximation algorithms for k-submodular function maximization. In: Krauthgamer R (ed) Proceedings of the twenty-seventh annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, 2016, SIAM, pp 404–413
Kempe D, Kleinberg JM, Tardos É (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, Washington, DC, USA, August 24–27, 2003, pp 137–146. https://doi.org/10.1145/956750.956769
Krause A, Singh AP, Guestrin C (2008) Near-optimal sensor placements in gaussian processes: theory, efficient algorithms and empirical studies. J Mach Learn Res 9:235–284
Kumar R, Moseley B, Vassilvitskii S, Vattani A (2013) Fast greedy algorithms in mapreduce and streaming. In: Blelloch GE, Vöcking B (eds) 25th ACM symposium on parallelism in algorithms and architectures, SPAA ’13, Montreal, QC, Canada—23–25, 2013, ACM, pp 1–10
Leskovec J, Krevl (2014) A. snap datasets: Stanford large network dataset collection. http://snap.stanford.edu/data
Li X, Smith JD, Dinh TN, Thai MT (2019) Tiptop: (almost) exact solutions for influence maximization in billion-scale networks. IEEE/ACM Trans Netw 27(2):649–661
Mirzasoleiman B, Badanidiyuru A, Karbasi A, Vondrák J, Krause A (2015) Lazier than lazy greedy. In: Bonet B, Koenig S (eds) Proceedings of the twenty-ninth AAAI conference on artificial intelligence, 2015, Austin, Texas, USA, AAAI Press, pp 1812–1818
Mirzasoleiman B, Badanidiyuru A, Karbasi A (2016) Fast constrained submodular maximization: personalized data summarization. In: Balcan M, Weinberger KQ (eds) Proceedings of the 33nd international conference on machine learning, ICML 2016, New York City, NY, USA, June 19–24, 2016, JMLR.org, JMLR workshop and conference proceedings, vol 48, pp 1358–1367
Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions - I. Math Program 14(1):265–294. https://doi.org/10.1007/BF01588971
Nguyen H, Zheng R (2013) On budgeted influence maximization in social networks. IEEE J Sel Areas Commun 31(6):1084–1094. https://doi.org/10.1109/JSAC.2013.130610
Nguyen L, Thai M (2020) Streaming k-submodular maximization under noise subject to size constraint. In: Daumé H, Singh A (eds) Proceedings of the international conference on machine learning, (ICML-2020), thirty-seventh international conference on machine learning
Ohsaka N, Yoshida Y (2015) Monotone k-submodular function maximization with size constraints. In: Cortes C, Lawrence ND, Lee DD, Sugiyama M, Garnett R (eds) Advances in neural information processing systems 28: annual conference on neural information processing systems 2015, Montreal, Quebec, Canada, pp 694–702
Oshima H (2017) Derandomization for k-submodular maximization. In: Brankovic L, Ryan J, Smyth WF (eds) Combinatorial algorithms—28th international workshop, IWOCA 2017, Lecture notes in computer science, vol 10765, pp 88–99
Qian C, Shi J, Tang K, Zhou Z (2018) Constrained monotone k-submodular function maximization using multiobjective evolutionary algorithms with theoretical guarantee. IEEE Trans Evol Comput 22(4):595–608
Rafiey A, Yoshida Y (2020) Fast and private submodular and k-submodular functions maximization with matroid constraints. In: Proceedings of the 37th international conference on machine learning, ICML 2020, 13–18, 2020, virtual event, proceedings of machine learning research, vol 119, pp 7887–7897
Rafiey A, Yoshida Y (2020) Fast and private submodular and k-submodular functions maximization with matroid constraints. In: Proceedings of the 37th international conference on machine learning, ICML 2020, 13-18 July 2020, virtual event, PMLR, proceedings of machine learning research, vol 119, pp 7887–7897
Sakaue S (2017) On maximizing a monotone k-submodular function subject to a matroid constraint. Discret Optim 23:105–113
Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Algorithms and Combinatorics
Singh AP, Guillory A, Bilmes JA (2012) On bisubmodular maximization. In: Lawrence ND, Girolami MA (eds) Proceedings of the fifteenth international conference on artificial intelligence and statistics, AISTATS 2012, La Palma, Canary Islands, Spain, 21–23, 2012, JMLR.org, JMLR proceedings, vol 22, pp 1055–1063
Soma T (2019) No-regret algorithms for online \(k\)-submodular maximization. In: Chaudhuri K, Sugiyama M (eds) The 22nd international conference on artificial intelligence and statistics, AISTATS 2019, 16–18 April 2019, Naha, Okinawa, Japan, proceedings of machine learning research, vol 89, pp 1205–1214
Sviridenko M (2004) A note on maximizing a submodular set function subject to a knapsack constraint. Oper Res Lett 32(1):41–43
Tang Z, Wang C, Chan H (2022) On maximizing a monotone k-submodular function under a knapsack constraint. Oper Res Lett 50(1):28–31
Thapper J, Zivný S (2012) The power of linear programming for valued csps. In: 53rd annual IEEE symposium on foundations of computer science, FOCS 2012, New Brunswick, NJ, USA, 2012, IEEE Computer Society, pp 669–678
Wang B, Zhou H (2021) Multilinear extension of k-submodular functions. CoRR abs/2107.07103, https://arxiv.org/abs/2107.07103, eprint2107.07103
Ward J, Zivný S (2014) Maximizing bisubmodular and k-submodular functions. In: Chekuri C (ed) Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms, SODA 2014, Portland, Oregon, USA, 2014, SIAM, pp 1468–1481
Wolsey LA (1982) Maximising real-valued submodular functions: primal and dual heuristics for location problems. Math Oper Res 7(3):410–425
Yang R, Xu D, Cheng Y, Gao C, Du D (2019) Streaming submodular maximization under noises. In: 39th IEEE international conference on distributed computing systems, ICDCS 2019, Dallas, TX, USA, July 7–10, 2019, IEEE, pp 348–357
Yu Q, Xu EL, Cui S (2016) Submodular maximization with multi-knapsack constraints and its applications in scientific literature recommendations. In: 2016 IEEE global conference on signal and information processing, GlobalSIP 2016, Washington, DC, USA, 2016, IEEE, pp 1295–1299
Zhang Y, Li M, Yang D, Xue G (2019) A budget feasible mechanism for k-topic influence maximization in social networks. In: 2019 IEEE global communications conference, GLOBECOM 2019, Waikoloa, HI, USA, December 9–13, 2019, IEEE, pp 1–6
Zheng L, Chan H, Loukides G, Li M (2021) Maximizing approximately k-submodular functions. In: Demeniconi C, Davidson I (eds) Proceedings of the 2021 SIAM international conference on data mining, SDM 2021, Virtual Event, 2021, SIAM, pp 414–422
Acknowledgements
This work was supported by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under Grant No. 102.01-2020.21. The work has been carried out partly at the Vietnam Institute for Advanced Study in Mathematics (VIASM). The first author (Canh V. Pham) would like to thank VIASM for the hospitality and financial support.
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.
A preliminary version appears in the proceedings of the 10th International Conference on Computational Data and Social Networks. This paper extends and revises the conference version by providing all the proofs more detail and experiment evaluation.
Rights and permissions
About this article
Cite this article
Pham, C.V., Vu, Q.C., Ha, D.K.T. et al. Maximizing k-submodular functions under budget constraint: applications and streaming algorithms. J Comb Optim 44, 723–751 (2022). https://doi.org/10.1007/s10878-022-00858-x
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-022-00858-x