98 search results - page 10 / 20 » Approximating minimum independent dominating sets in wireles... |
INFOCOM
2011
IEEE
12 years 10 months ago
2011
IEEE
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
OL
2010
13 years 2 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
SNPD
2007
13 years 8 months ago
2007
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
CGF
2006
13 years 7 months ago
2006
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...