Algorithms for Interference Minimization in Future Wireless Network Decomposition
From MaRDI portal
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Clustering in the social and behavioral sciences (91C20)
Abstract: We propose a simple and fast method for providing a high quality solution for the sum-interference minimization problem. As future networks are deployed in high density urban areas, improved clustering methods are needed to provide low interference network connectivity. The proposed algorithm applies straightforward similarity based clustering and optionally stable matchings to outperform state of the art algorithms. The running times of our algorithms are dominated by one matrix multiplication.
This page was built for publication: Algorithms for Interference Minimization in Future Wireless Network Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6381862)
