414 search results - page 10 / 83 » An Approximation Algorithm for the Minimum Latency Set Cover... |
96
Voted
ICCNMC
2005
Springer
15 years 8 months ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
128
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
111
click to vote
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
104
click to vote
CCS
2008
ACM
15 years 4 months ago
2008
ACM
Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analy...
109
click to vote
FCT
2007
Springer
15 years 8 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...