This paper also proposes a lower complexity(O(N2)) heuristic node selection algorithm while achieving a nearly optimal performance.
首先针对节点间的协同数据压缩问题进行量化,建立线性规划模型;进而提出一种近似最优的、更低时间复杂度(O(N2))的启发式节点筛选算法。
