331 search results - page 32 / 67 » Approximation Algorithms for Connected Dominating Sets |
160
click to vote
JPDC
2007
14 years 11 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
128
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
116
click to vote
CLUSTER
2002
IEEE
14 years 11 months ago
2002
IEEE
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—IEEE 802.11 WiFi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using h...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...