{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T19:41:08Z","timestamp":1740166868033,"version":"3.37.3"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T00:00:00Z","timestamp":1715299200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T00:00:00Z","timestamp":1715299200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["871643","871643"],"award-info":[{"award-number":["871643","871643"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]},{"name":"HORIZON-RIA - HORIZON Research and Innovation Actions","award":["101070516","101070516"],"award-info":[{"award-number":["101070516","101070516"]}]},{"DOI":"10.13039\/501100005366","name":"University of Oslo","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005366","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Cloud applications are built from a set of components often deployed as containers, which can be deployed individually on separate Virtual Machines (VMs) or grouped on a smaller set of VMs. Additionally, the application owner may have inhibition constraints regarding the co-location of components. Finding the best way to deploy an application means finding the best groups of components and the best VMs, and it is not trivial because of the complexity coming from the number of possible options. The problem can be mapped onto may known combinatorial problems as binpacking and knapsack formulations. However, these approaches often assume homogeneus resources and fail to incorporate the inhibition constraints. The main contribution of this paper are firstly a novel formulation of the grouping problem as constrained Coalition Structure Generation (CSG) problem, including the specification of the value function which fulfills the criteria of a Characteristic Function Game (CFG). The CSG problem aims to determine stable and disjoint groups of players collaborating to optimize the joint outcome of the game, and a CFG is a common representation of a CSG, where each group is assigned a value and where the value of the game is the sum of the groups\u2019 contributions. Secondly, the Integer-Partition (IP) CSG algorithm has been modified and extended to handle constraints. The proposed approach is evaluated with the extended IP algorithm, and a novel exhaustive search algorithm establishing the optimum grouping for comparison. The evaluation shows that our approach with the modified algorithm evaluates on average significantly less combinations than the CSG state-of-the-art algorithm. The proposed approach is promising for optimized constrained Cloud application management as the modified IP algorithm can optimally solve constrained grouping problems of attainable sizes.<\/jats:p>","DOI":"10.1186\/s13677-024-00653-5","type":"journal-article","created":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T15:01:52Z","timestamp":1715353312000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constrained optimal grouping of cloud application components"],"prefix":"10.1186","volume":"13","author":[{"given":"Marta","family":"R\u00f3\u017ca\u0144ska","sequence":"first","affiliation":[]},{"given":"Geir","family":"Horn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,10]]},"reference":[{"key":"653_CR1","unstructured":"Marinescu DC (2022) Cloud Computing: Theory and Practice. Morgan Kaufmann, p 674. Google-Books-ID: XOBWEAAAQBAJ. ISBN: 978-0-323-91047-7"},{"key":"653_CR2","doi-asserted-by":"crossref","unstructured":"Apostolou D, Verginadis Y, Mentzas G (2021) In the fog: Application deployment for the cloud continuum. In: 2021 12th International Conference on Information, Intelligence, Systems & Applications (IISA), IEEE, pp 1\u20137","DOI":"10.1109\/IISA52424.2021.9555532"},{"key":"653_CR3","doi-asserted-by":"publisher","unstructured":"Horn G, Skrzypek P (2018) MELODIC: Utility based cross cloud deployment optimisation. In: Proceedings of the 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA), IEEE Computer Society, Krakow, pp 360\u2013367. https:\/\/doi.org\/10.1109\/WAINA.2018.00112","DOI":"10.1109\/WAINA.2018.00112"},{"issue":"1","key":"653_CR4","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MIC.2007.2","volume":"11","author":"JO Kephart","year":"2007","unstructured":"Kephart JO, Das R (2007) Achieving self-management via utility functions. IEEE Internet Comput 11(1):40\u201348. https:\/\/doi.org\/10.1109\/MIC.2007.2","journal-title":"IEEE Internet Comput"},{"key":"653_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-4-431-54971-0","author":"T Onozaki","year":"2018","unstructured":"Onozaki T (2018) Nonlinearity, Bounded Rationality, and Heterogeneity. Springer, Tokyo. https:\/\/doi.org\/10.1007\/978-4-431-54971-0","journal-title":"Springer, Tokyo."},{"key":"653_CR6","doi-asserted-by":"publisher","unstructured":"Ahmad Z, Jehangiri AI, Ala\u2019anzy MA, Othman M, Latip R, Zaman SKU, Umar AI (2021) Scientific workflows management and scheduling in cloud computing: Taxonomy, prospects, and challenges. IEEE Access 9:53491\u201353508. https:\/\/doi.org\/10.1109\/ACCESS.2021.3070785. IEEE Access, ISSN: 2169-3536","DOI":"10.1109\/ACCESS.2021.3070785"},{"key":"653_CR7","doi-asserted-by":"publisher","unstructured":"Bittencourt L, Immich R, Sakellariou R, Fonseca N, Madeira E, Curado M, Villas L, DaSilva L, Lee C, Rana O (2018) The internet of things, fog and cloud continuum: Integration and challenges. Internet Things 3-4:134-155. https:\/\/doi.org\/10.1016\/j.iot.2018.09.005. ISSN: 25426605.","DOI":"10.1016\/j.iot.2018.09.005"},{"key":"653_CR8","doi-asserted-by":"publisher","unstructured":"Manvi SS, Krishna Shyam G (2014) Resource management for infrastructure as a service (IaaS) in cloud computing: a survey. J Netw Comput Appl 41:424\u2013440. https:\/\/doi.org\/10.1016\/j.jnca.2013.10.004. ISSN: 1084-8045","DOI":"10.1016\/j.jnca.2013.10.004"},{"key":"653_CR9","doi-asserted-by":"publisher","unstructured":"Rahwan T, Ramchurn SD, Jennings NR, Giovannucci A (2009) An anytime algorithm for optimal coalition structure generation.J Artif Intell Res 34:521\u2013567. https:\/\/doi.org\/10.1613\/jair.2695. ISSN: 1076-9757","DOI":"10.1613\/jair.2695"},{"key":"653_CR10","doi-asserted-by":"publisher","unstructured":"Stanley RP (2011) Enumerative Combinatorics, Cambridge Studies in Advanced Mathematics, vol\u00a01, 2nd edn. Cambridge University Press, Cambridge, p 640. https:\/\/doi.org\/10.1017\/CBO9781139058520. ISBN: 978-1-107-01542-5","DOI":"10.1017\/CBO9781139058520"},{"key":"653_CR11","doi-asserted-by":"publisher","unstructured":"Bell ET (1938) The iterated exponential integers. Ann Math 39(3):539\u2013557. https:\/\/doi.org\/10.2307\/1968633. ISSN: 0003-486X","DOI":"10.2307\/1968633"},{"key":"653_CR12","doi-asserted-by":"publisher","unstructured":"Rota G-C (1964) The number of partitions of a set. Am Math Mon 71(5):498\u2013504. https:\/\/doi.org\/10.2307\/2312585. ISSN: 0002-9890","DOI":"10.2307\/2312585"},{"key":"653_CR13","unstructured":"Dobi\u0144ski G (1877) Summirung der reihe sum (nm\/n!) f\u00fcr m = 1, 2, 3, 4, 5, ... Grunert Arch Math Phys 6:333\u2013336"},{"key":"653_CR14","unstructured":"Comtet L (1974) Advanced Combinatorics: The Art of Finite and Infinite Expansions. D. Reidel, Dordrecht. ISBN: 90-277-0380-9."},{"key":"653_CR15","unstructured":"Berend D, Tassa T (2010) Improved bounds on bell numbers and on moments of sums of random variables. Probab Math Stat-Pol 30(2):185\u2013205. ISSN: 0208-4147"},{"key":"653_CR16","doi-asserted-by":"publisher","unstructured":"King JR, Nakornchai V (1982) Machine-component group formation in group technology: review and extension. Int J Prod Res 20(2):117\u2013133. https:\/\/doi.org\/10.1080\/00207548208947754. Taylor & Francis","DOI":"10.1080\/00207548208947754"},{"key":"653_CR17","doi-asserted-by":"publisher","unstructured":"Burbidge JL (1985) Production flow analysis. In: Bullinger HJ, Warnecke HJ (eds) Toward the Factory of the Future, Springer, Berlin, pp 34\u201342. https:\/\/doi.org\/10.1007\/978-3-642-82580-4_7. ISBN: 978-3-642-82580-4","DOI":"10.1007\/978-3-642-82580-4_7"},{"key":"653_CR18","doi-asserted-by":"publisher","unstructured":"Pentico DW (2007) Assignment problems: A golden anniversary survey. Eur J Oper Res 176(2):774\u2013793. https:\/\/doi.org\/10.1016\/j.ejor.2005.09.014. ISSN: 0377-2217","DOI":"10.1016\/j.ejor.2005.09.014"},{"key":"653_CR19","doi-asserted-by":"publisher","unstructured":"Christensen HI, Khan A, Pokutta S, Tetali P (2017) Approximation and online algorithms for multidimensional bin packing: A survey. Comput Sci Rev. 24:63\u201379. https:\/\/doi.org\/10.1016\/j.cosrev.2016.12.001. ISSN: 1574-0137","DOI":"10.1016\/j.cosrev.2016.12.001"},{"key":"653_CR20","doi-asserted-by":"publisher","unstructured":"Bansal N, Eli\u00e1s M, Khan A (2016) Improved approximation for vector bin packing. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201915), Society for Industrial and Applied Mathematics, Arlington, pp 1561\u20131579. https:\/\/doi.org\/10.1137\/1.9781611974331.ch106","DOI":"10.1137\/1.9781611974331.ch106"},{"key":"653_CR21","doi-asserted-by":"publisher","unstructured":"Patt-Shamir B, Rawitz D (2012) Vector bin packing with multiple-choice. Discret Appl Math 160(10):1591\u20131600. https:\/\/doi.org\/10.1016\/j.dam.2012.02.020. ISSN: 0166-218X","DOI":"10.1016\/j.dam.2012.02.020"},{"key":"653_CR22","doi-asserted-by":"crossref","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack Problems. Springer, p 566. ISBN: 3-540-40286-1","DOI":"10.1007\/978-3-540-24777-7_1"},{"issue":"5","key":"653_CR23","doi-asserted-by":"publisher","first-page":"365","DOI":"10.4236\/ajor.2018.85023","volume":"8","author":"S Laabadi","year":"2018","unstructured":"Laabadi S, Naimi M, El Amri H, Achchab B (2018) The 0\/1 multidimensional knapsack problem and its variants: A survey of practical models and heuristic approaches. Am J Oper Res 8(5):365\u2013439. https:\/\/doi.org\/10.4236\/ajor.2018.85023","journal-title":"Am J Oper Res"},{"key":"653_CR24","doi-asserted-by":"publisher","unstructured":"Yi C, Cai J (2014) Combinatorial spectrum auction with multiple heterogeneous sellers in cognitive radio networks. In: Proceedings of the IEEE International Conference on Communications (ICC), ISSN: 1938-1883. IEEE, Sydney, pp 1626\u20131631. https:\/\/doi.org\/10.1109\/ICC.2014.6883555. ISBN: 978-1-4799-2003-7","DOI":"10.1109\/ICC.2014.6883555"},{"key":"653_CR25","doi-asserted-by":"publisher","unstructured":"Song Y, Zhang C, Fang Y (2008) Multiple multidimensional knapsack problem and its applications in cognitive radio networks. In: Proceedings of the 2008 IEEE Military Communications Conference (MILCOM), ISSN: 2155-7586. San Diego, pp 1\u20137. https:\/\/doi.org\/10.1109\/MILCOM.2008.4753629","DOI":"10.1109\/MILCOM.2008.4753629"},{"key":"653_CR26","unstructured":"Camati RS, Calsavara A, Lima Jr L (2014) Solving the virtual machine placement problem as a multiple multidimensional knapsack problem. In: Proceedings of the The Thirteenth International Conference on Networks (ICN\u201914), IARIA, Nice, pp 253\u2013260. ISBN: 978-1-61208-318-6"},{"key":"653_CR27","doi-asserted-by":"publisher","unstructured":"He C, Leung JY-T, Lee K, Pinedo ML (2016) An improved binary search algorithm for the multiple-choice knapsack problem. RAIRO Oper Res 50(4):995\u20131001. https:\/\/doi.org\/10.1051\/ro\/2015061. ISSN: 0399-0559, 1290-3868","DOI":"10.1051\/ro\/2015061"},{"key":"653_CR28","doi-asserted-by":"publisher","unstructured":"Lust T, Teghem J (2012) The multiobjective multidimensional knapsack problem: a survey and a new approach. Int Trans Oper Res 19(4):495\u2013520. https:\/\/doi.org\/10.1111\/j.1475-3995.2011.00840.x. ISSN: 1475-3995","DOI":"10.1111\/j.1475-3995.2011.00840.x"},{"key":"653_CR29","doi-asserted-by":"publisher","unstructured":"Horn G, R\u00f3\u017ca\u0144ska M (2019) Affine scalarization of two-dimensional utility using the pareto front. In: Proceedings of the IEEE International Conference on Autonomic Computing (ICAC 2019), ISSN: 2474-0756, 2474-0764. IEEE, Ume\u00e5, pp 147\u2013156. https:\/\/doi.org\/10.1109\/ICAC.2019.00026","DOI":"10.1109\/ICAC.2019.00026"},{"key":"653_CR30","doi-asserted-by":"publisher","unstructured":"Vo\u00df S, Lalla-Ruiz E (2016) A set partitioning reformulation for the multiple-choice multidimensional knapsack problem. Eng Optim 48(5):831\u2013850. https:\/\/doi.org\/10.1080\/0305215X.2015.1062094. ISSN: 0305-215X","DOI":"10.1080\/0305215X.2015.1062094"},{"key":"653_CR31","doi-asserted-by":"publisher","unstructured":"Rahwan T, Michalak TP, Wooldridge M, Jennings NR (2015) Coalition structure generation: A survey. Artif Intell 229:139\u2013174. https:\/\/doi.org\/10.1016\/j.artint.2015.08.004. ISSN: 0004-3702","DOI":"10.1016\/j.artint.2015.08.004"},{"key":"653_CR32","unstructured":"Michalak T, Sroka J, Rahwan T, Wooldridge M, McBurney P, Jennings NR (2010) A distributed algorithm for anytime coalition structure generation. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: Volume 1 - Volume 1, AAMAS \u201910. International Foundation for Autonomous Agents and Multiagent Systems, Toronto, pp 1007\u20131014. ISBN: 978-0-9826571-1-9"},{"key":"653_CR33","doi-asserted-by":"publisher","unstructured":"Michalak T, Rahwan T, Elkind E, Wooldridge M, Jennings NR (2016) A hybrid exact algorithm for complete set partitioning. Artif Intell 230:14\u201350. https:\/\/doi.org\/10.1016\/j.artint.2015.09.006. ISSN: 0004-3702","DOI":"10.1016\/j.artint.2015.09.006"},{"key":"653_CR34","doi-asserted-by":"publisher","unstructured":"Rahwan T, Michalak T, Elkind E, Faliszewski P, Sroka J, Wooldridge M, Jennings N (2011) Constrained coalition formation. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 25, no. 1. pp 719\u2013725. https:\/\/doi.org\/10.1609\/aaai.v25i1.7888. ISSN: 2374-3468","DOI":"10.1609\/aaai.v25i1.7888"},{"key":"653_CR35","doi-asserted-by":"crossref","unstructured":"Ueda S, Iwasaki A, Yokoo M, Silaghi MC, Hirayama K, Matsui T (2010) Coalition structure generation based on distributed constraint optimization. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of Artificial Intelligence Conference (AAAI-10 \/ IAAI-10), vol\u00a01. Atlanta, pp 197\u2013203. ISBN: 978-1-57735-464-2","DOI":"10.1609\/aaai.v24i1.7552"},{"key":"653_CR36","doi-asserted-by":"publisher","unstructured":"Paraskevoulakou E, Tom-Ata JDT, Symvoulidis C, Kyriazis D (2024) Enhancing cloud-based application component placement with ai-driven operations. In: 2024 IEEE 14th Annual Computing and Communication Workshop and Conference (CCWC), pp 0687\u20130694. https:\/\/doi.org\/10.1109\/CCWC60891.2024.10427694","DOI":"10.1109\/CCWC60891.2024.10427694"},{"key":"653_CR37","doi-asserted-by":"publisher","unstructured":"Chitgar N, Jazayeriy H, Rabiei M (2019) Improving Cloud Computing Performance Using Task Scheduling Method Based on VMs Grouping. In: 2019 27th Iranian Conference on Electrical Engineering (ICEE), iSSN: 2642-9527. pp 2095\u20132099. https:\/\/doi.org\/10.1109\/IranianCEE.2019.8786391","DOI":"10.1109\/IranianCEE.2019.8786391"},{"key":"653_CR38","doi-asserted-by":"publisher","unstructured":"Selvarani S, Sadhasivam GS (2010) Improved cost-based algorithm for task scheduling in cloud computing. In: 2010 IEEE International Conference on Computational Intelligence and Computing Research, pp 1\u20135. https:\/\/doi.org\/10.1109\/ICCIC.2010.5705847","DOI":"10.1109\/ICCIC.2010.5705847"},{"key":"653_CR39","doi-asserted-by":"publisher","unstructured":"Nishio T, Shinkuma R, Takahashi T, Mandayam NB (2013) Service-oriented heterogeneous resource sharing for optimizing service latency in mobile cloud. In: Proceedings of the first international workshop on Mobile cloud computing & networking, ser. MobileCloud \u201913. Association for Computing Machinery, New York, pp 19\u201326. https:\/\/doi.org\/10.1145\/2492348.2492354. ISBN: 978-1-4503-2206-5","DOI":"10.1145\/2492348.2492354"},{"key":"653_CR40","doi-asserted-by":"publisher","unstructured":"Santos J, Wauters T, Volckaert B, De Turck F (2021) Towards end-to-end resource provisioning in fog computing over low power wide area networks. J Netw Comput Appl 175:102915. https:\/\/doi.org\/10.1016\/j.jnca.2020.102915. ISSN: 1084-8045","DOI":"10.1016\/j.jnca.2020.102915"},{"key":"653_CR41","doi-asserted-by":"publisher","unstructured":"Wu C, Buyya R, Ramamohanarao K (2020) Modeling cloud business customers\u2019 utility functions. Futur Gener Comput Syst 105:737\u2013753. https:\/\/doi.org\/10.1016\/j.future.2019.12.044. ISSN: 0167-739X","DOI":"10.1016\/j.future.2019.12.044"},{"key":"653_CR42","doi-asserted-by":"publisher","unstructured":"R\u00f3\u017ca\u0144ska M, Kritikos K, Marchel J, Folga D, Horn G (2023) Utility function creator for cloud application optimization. In: Barolli L (ed) Advanced Information Networking and Applications, Lecture Notes in Networks and Systems. Springer International Publishing, Cham, pp 619\u2013630. https:\/\/doi.org\/10.1007\/978-3-031-28694-0_58. ISBN: 978-3-031-28694-0","DOI":"10.1007\/978-3-031-28694-0_58"},{"key":"653_CR43","doi-asserted-by":"publisher","unstructured":"R\u00f3\u017ca\u0144ska M, Horn G (2022) Proactive autonomic cloud application management. In: Proceedings of the 15th IEEE\/ACM International Conference on Utility and Cloud Computing (UCC2022). IEEE\/ACM, Vancouver, pp 102\u2013111. https:\/\/doi.org\/10.1109\/UCC56403.2022.00021. ISBN: 978-1-66546-087-3","DOI":"10.1109\/UCC56403.2022.00021"},{"key":"653_CR44","unstructured":"Luenberger DG, Ye Y (2008) Linear and Nonlinear Programming, 3rd edn. Springer. ISBN: 978-0-387-74502-2"},{"key":"653_CR45","unstructured":"Korte B, Vygen J (2018) Combinatorial Optimization: Theory and Algorithms, Algorithms and Combinatorics, vol 21, 6th edn. Springer, Berlin Heidelberg, p 627. ISBN: 978-3-540-71843-7"},{"key":"653_CR46","doi-asserted-by":"publisher","unstructured":"Soewito B, Gaol FL, Abdurachman E (2022) A systematic literature review: Risk analysis in cloud migration. J King Saud Univ Comput Inf Sci 34(6):3111\u20133120. https:\/\/doi.org\/10.1016\/j.jksuci.2021.01.008. ISSN: 1319-1578","DOI":"10.1016\/j.jksuci.2021.01.008"},{"key":"653_CR47","doi-asserted-by":"publisher","unstructured":"Gribaudo M, Iacono M, Manini D (2017) Performance evaluation of massively distributed microservices based applications. In: ECMS 2017 Proceedings edited by Zita Zoltay Paprika, P\u00e9ter Hor\u00e1k, Kata V\u00e1radi, P\u00e9ter Tam\u00e1s Zwierczyk, \u00c1gnes Vidovics-Dancs, J\u00e1nos P\u00e9ter R\u00e1dics, ECMS, pp 598\u2013604. https:\/\/doi.org\/10.7148\/2017-0598. ISBN: 978-0-9932440-4-9","DOI":"10.7148\/2017-0598"},{"key":"653_CR48","doi-asserted-by":"publisher","unstructured":"Stanton D, White D (1986) Constructive Combinatorics (Undergraduate Texts in Mathematics). In: Gehring FW, Halmos PR (eds), 1st edn. Springer, New York. https:\/\/doi.org\/10.1007\/978-1-4612-4968-9. ISBN: 978-1-4612-4968-9","DOI":"10.1007\/978-1-4612-4968-9"},{"key":"653_CR49","doi-asserted-by":"publisher","unstructured":"Mansour T, Nassar G (2008) Gray codes, loopless algorithm and partitions. J Math Model Algoritm 7(3):291\u2013310. https:\/\/doi.org\/10.1007\/s10852-008-9086-9. ISSN: 1572-9214","DOI":"10.1007\/s10852-008-9086-9"},{"key":"653_CR50","unstructured":"Keresk\u00e9nyi-Balogh Z, Nyul G (2014) Stirling numbers of the second kind and bell numbers for graphs. Aust J Comb 58(2):264\u2013274. ISSN: 1034-4942"},{"key":"653_CR51","doi-asserted-by":"publisher","unstructured":"Berceanu C (2001) Chromatic polynomials and k-trees. Demonstratio Math 34(4):743\u2013748. https:\/\/doi.org\/10.1515\/dema-2001-0402. ISSN: 2391-4661","DOI":"10.1515\/dema-2001-0402"},{"key":"653_CR52","doi-asserted-by":"publisher","unstructured":"Pemmaraju S, Skiena S (2003) Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Cambridge University Press, Cambridge. https:\/\/doi.org\/10.1017\/CBO9781139164849. ISBN: 978-0-521-12146-0","DOI":"10.1017\/CBO9781139164849"},{"key":"653_CR53","doi-asserted-by":"publisher","unstructured":"Sandholm T, Larson K, Andersson M, Shehory O, Tohm\u00e9 F (1999) Coalition structure generation with worst case guarantees. Artif Intell 111(1):209\u2013238. https:\/\/doi.org\/10.1016\/S0004-3702(99)00036-3. ISSN: 0004-3702","DOI":"10.1016\/S0004-3702(99)00036-3"},{"key":"653_CR54","doi-asserted-by":"publisher","unstructured":"Verginadis Y, Sarros CA, de\u00a0Los\u00a0Mozos MR, Veloudis S, Piliszek R, Kourtellis N, Horn G (2023) NebulOuS: A meta-operating system with cloud continuum brokerage capabilities. In: 2023 Eighth International Conference on Fog and Mobile Edge Computing (FMEC), pp 254\u2013261. https:\/\/doi.org\/10.1109\/FMEC59375.2023.10306090","DOI":"10.1109\/FMEC59375.2023.10306090"},{"key":"653_CR55","doi-asserted-by":"publisher","unstructured":"de Vries S, Vohra RV (2003) Combinatorial auctions: a survey. INFORMS J Comput 15(3):284\u2013309. https:\/\/doi.org\/10.1287\/ijoc.15.3.284.16077. INFORMS, ISSN: 1091-9856","DOI":"10.1287\/ijoc.15.3.284.16077"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-024-00653-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13677-024-00653-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-024-00653-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T15:06:32Z","timestamp":1715353592000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-024-00653-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,10]]},"references-count":55,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["653"],"URL":"https:\/\/doi.org\/10.1186\/s13677-024-00653-5","relation":{},"ISSN":["2192-113X"],"issn-type":[{"type":"electronic","value":"2192-113X"}],"subject":[],"published":{"date-parts":[[2024,5,10]]},"assertion":[{"value":"23 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"99"}}