6 citations · 22 across the 7 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2013★ 5 cited
Matroid and Knapsack Center Problems
Danny Z. Chen, Jian Li, Hongyu Liang +1
In the classic -center problem, we are given a metric graph, and the objective is to open nodes as centers such that the maximum distance from any vertex to its closest cent…
cs.DS2013★ 4 cited
On the Complexity of -Closeness Anonymization and Related Problems
Hongyu Liang, Hao Yuan
An important issue in releasing individual data is to protect the sensitive information from being leaked and maliciously utilized. Famous privacy preserving principles that aim to…
cs.DS2013
On the Complexity of Connectivity in Cognitive Radio Networks Through Spectrum Assignment
Hongyu Liang, Tiancheng Lou, Haisheng Tan +2
Cognitive Radio Networks (CRNs) are considered as a promising solution to the spectrum shortage problem in wireless communication. In this paper, we initiate the first systematic s…