1046 search results - page 15 / 210 » Approximation Algorithms for Domination Search |
139
Voted
APWEB
2006
Springer
15 years 6 months ago
2006
Springer
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
135
Voted
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 2 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
125
Voted
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
134
Voted
FOCS
2008
IEEE
15 years 9 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...
146
Voted
ICTAI
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...