Parallel approximation and exact algorithms for resource scheduling in v-RANs

DOI10.1016/J.TCS.2026.116176MaRDI QIDQ7347263zbMATH OpenFDO

Authors Qinqin Gong, Xiankun Yu, Donglei Du, Dachuan Xu, Ruiqi Yang

Publication date 14 September 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116176

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A submodular optimization framework for outage-aware cell association in heterogeneous cellular networks
• An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model
• scientific article; zbMATH DE number 3635849 (Why is no real title available?)
• On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
• Parallelizing greedy for submodular set function maximization in matroids and beyond
• Parallelizing scheduling algorithms for resource allocation under V-RAN
• Submodular function maximization in parallel via the multilinear relaxation
• Submodular maximization with matroid and packing constraints in parallel
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• The adaptive complexity of maximizing a submodular function
• The complexity of parallel search
• Unconstrained submodular maximization with constant adaptive complexity

This page was built for publication: Parallel approximation and exact algorithms for resource scheduling in v-RANs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7347263)