331 search results - page 19 / 67 » Approximation Algorithms for Connected Dominating Sets |
157
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
222
click to vote
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
Consider a set of signals fs : {1, . . . , N} [0, . . . , M] appearing as a stream of tuples (i, fs(i)) in arbitrary order of i and s. We would like to devise one pass approximat...
114
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
126
Voted
TCS
2008
15 years 3 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
152
Voted
CGF
2006
15 years 3 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...