{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:39:32Z","timestamp":1767317972013,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819548385","type":"print"},{"value":"9789819548392","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-4839-2_15","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:35:12Z","timestamp":1767317712000},"page":"192-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallelizing Scheduling Algorithms for\u00a0Resource Allocation Under V-RAN"],"prefix":"10.1007","author":[{"given":"Qinqin","family":"Gong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiankun","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruiqi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Balkanski, E., Rubinstein, A., Singer, Y.: An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model. In: Proceedings of STOC, pp. 66\u201377 (2019)","DOI":"10.1145\/3313276.3316304"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Balkanski, E., Singer, Y.: The adaptive complexity of maximizing a submodular function. In: Proceedings of STOC, pp. 1138\u20131151 (2018)","DOI":"10.1145\/3188745.3188752"},{"issue":"6","key":"15_CR3","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.3390\/s19061412","volume":"19","author":"B Bikram Kumar","year":"2019","unstructured":"Bikram Kumar, B., Sharma, L., Wu, S.L.: Online distributed UE association for heterogeneous radio access network. Sensors 19(6), 1412 (2019)","journal-title":"Sensors"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Quanrud, K.: Parallelizing greedy for submodular set function maximization in matroids and beyond. In: Proceedings of STOC, pp. 78\u201389 (2019)","DOI":"10.1145\/3313276.3316406"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Quanrud, K.: Submodular function maximization in parallel via the multilinear relaxation. In: Proceedings of SODA, pp. 303\u2013322 (2019)","DOI":"10.1137\/1.9781611975482.20"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Chen L, Feldman M, Karbasi A. Unconstrained submodular maximization with constant adaptive complexity. In: Proceedings of STOC, pp. 102\u2013113 (2019)","DOI":"10.1145\/3313276.3316327"},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti, M., Cornu\u00e9jols, G.: Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discret. Appl. Math. 7(3), 251\u2013274 (1984)","journal-title":"Discret. Appl. Math."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Ene, A., Nguy$$\\tilde{\\hat{\\text{e}}}$$, H.L., Vladu, A.: Submodular maximization with matroid and packing constraints in parallel. In: Proceedings of STOC, pp. 90\u2013101 (2019)","DOI":"10.1145\/3313276.3316389"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Fisher, M.L., NemhaUE, G.L., Wolsey, L.A.: An analysis of approximations for maximizing submodular set functions-II. Polyhedral Combinatorics, 73\u201387 (2019)","DOI":"10.1007\/BFb0121195"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0022-0000(88)90027-X","volume":"36","author":"RM Karp","year":"1988","unstructured":"Karp, R.M., Upfal, E., Wigderson, A.: The complexity of parallel search. J. Comput. Syst. Sci. 36(2), 225\u2013253 (1988)","journal-title":"J. Comput. Syst. Sci."},{"issue":"10","key":"15_CR11","doi-asserted-by":"publisher","first-page":"2229","DOI":"10.1109\/TMC.2013.2297310","volume":"13","author":"HS Liao","year":"2014","unstructured":"Liao, H.S., Chen, P.Y., Chen, W.T.: An efficient downlink radio resource allocation with carrier aggregation in LTE-advanced networks. IEEE Trans. Mob. Comput. 13(10), 2229\u20132239 (2014)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.comnet.2018.09.012","volume":"146","author":"JS Liu","year":"2018","unstructured":"Liu, J.S.: Joint downlink resource allocation in LTE-Advanced heterogeneous networks. Comput. Netw. 146, 85\u2013103 (2018)","journal-title":"Comput. Netw."},{"issue":"7","key":"15_CR13","doi-asserted-by":"publisher","first-page":"6446","DOI":"10.1109\/TVT.2018.2805190","volume":"67","author":"A Roy","year":"2018","unstructured":"Roy, A., Chaporkar, P., Karandikar, A.: Optimal radio access technology selection algorithm for LTE-WIFI network. IEEE Trans. Veh. Technol. 67(7), 6446\u20136460 (2018)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Sinha, A., Andrews, M., Ananth, P.: Scheduling algorithms for 5G networks with mid-haul capacity constraints. In: Proceedings of of WiOPT, pp. 1\u20138 (2019)","DOI":"10.23919\/WiOPT47501.2019.9144144"},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1109\/TCOMM.2017.2649519","volume":"65","author":"RG Stephen","year":"2017","unstructured":"Stephen, R.G., Zhang, R.: Joint millimeter-wave fronthaul and OFDMA resource allocation in ultra-dense CRAN. IEEE Trans. Commun. 65(3), 1411\u20131423 (2017)","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1287\/opre.1040.0156","volume":"53","author":"AL Stolyar","year":"2005","unstructured":"Stolyar, A.L.: On the asymptotic optimality of the gradient scheduling algorithm for multiUE throughput allocation. Oper. Res. 53(1), 12\u201325 (2005)","journal-title":"Oper. Res."},{"key":"15_CR17","first-page":"4567625","volume":"1","author":"G Su","year":"2016","unstructured":"Su, G., Chen, B., Lin, X., et al.: A submodular optimization framework for outage-aware cell association in heterogeneous cellular networks. Math. Probl. Eng. 1, 4567625 (2016)","journal-title":"Math. Probl. Eng."},{"issue":"3","key":"15_CR18","doi-asserted-by":"publisher","first-page":"2003","DOI":"10.1109\/TWC.2019.2901684","volume":"18","author":"W Xia","year":"2019","unstructured":"Xia, W., Quek, T.Q.S., Zhang, J., et al.: Programmable hierarchical C-RAN: from task scheduling to resource allocation. IEEE Trans. Wireless Commun. 18(3), 2003\u20132016 (2019)","journal-title":"IEEE Trans. Wireless Commun."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4839-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:35:13Z","timestamp":1767317713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4839-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819548385","9789819548392"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4839-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.maths.sdnu.edu.cn\/TAMC2025.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}