...
机译:社交网络中最小支配集的有效逼近算法
Computer Science Department, College of Informatics, Northern Kentucky University, Highland Heights, USA;
Computer Science Department, College of Informatics, Northern Kentucky University, Highland Heights, USA;
Computer Science Department, College of Informatics, Northern Kentucky University, Highland Heights, USA;
D-Hop Dominating Sets; Dominating Sets; Greedy Algorithms; Influence Maximization; Partial Dominating Sets; Social Networks;
机译:匿名平面网络中最小控制集问题的局部逼近算法
机译:无线自组网中构造最小连通支配集的新分布式近似算法
机译:单位磁盘图上最小加权支配集和最小加权连通支配集的新近似值
机译:有效的近似算法来确定社交网络中的最小局部支配集
机译:分布式近似算法,用于最小生成树和其他相关问题,应用于无线自组织网络
机译:Ad Hoc传感器网络的最小连通支配集算法
机译:单位磁盘图上最小加权支配集和最小加权连通支配集的新近似值