Presentations of new results on graphs and matroid theory can be heard at operations research conferences, while papers on linear programming, network flows, and matching in graphs are frequently ...

Due to the non-deterministic polynomial-time hardness (NP-hardness) in the problems of task offloading and resource allocation, we reformulate a matroid-constrained submodular maximization problem and ...