331 search results - page 26 / 67 » Approximation Algorithms for Connected Dominating Sets |
212
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
139
Voted
DEXA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
96
Voted
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
116
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
139
click to vote
IJWIN
2006
15 years 3 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...