174 search results - page 18 / 35 » Dispersion in Unit Disks |
115
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of ...
151
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 4 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...
126
click to vote
ICIS
2003
15 years 5 months ago
2003
ThelinkagesbetweenISandbusinessunitsarerecognizedasbeingcriticaltoinformationsystemsdevelopment processes and outcomes. Previous research has found that they are associated with b...
139
click to vote
DCOSS
2009
Springer
15 years 9 months ago
2009
Springer
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
142
click to vote
AHSWN
2008
15 years 4 months ago
2008
Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new i...