8 citations · 11 across the 5 of their papers we have counts for
5 papers
Dynamic Shortest Path Algorithms for Hypergraphs
Jianhang Gao, Qing Zhao, Wei Ren +3
A hypergraph is a set V of vertices and a set of non-empty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higher-order interactions in social and communica…
A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem'
Wei Ren, Qing Zhao
A flaw in the greedy approximation algorithm proposed by Zhang et al. for minimum connected set cover problem is corrected, and a stronger result on the approximation ratio of the…
On the Connectivity and Multihop Delay of Ad Hoc Cognitive Radio Networks
Wei Ren, Qing Zhao, Ananthram Swami
We analyze the multihop delay of ad hoc cognitive radio networks, where the transmission delay of each hop consists of the propagation delay and the waiting time for the availabili…
Connectivity of Heterogeneous Wireless Networks
Wei Ren, Qing Zhao, Ananthram Swami
We address the connectivity of large-scale ad hoc heterogeneous wireless networks, where secondary users exploit channels temporarily unused by primary users and the existence of a…
Power Control in Cognitive Radio Networks: How to Cross a Multi-Lane Highway
Wei Ren, Qing Zhao, Ananthram Swami
We consider power control in cognitive radio networks where secondary users identify and exploit instantaneous and local spectrum opportunities without causing unacceptable interfe…