291 search results - page 28 / 59 » Factor 2 Approximation Algorithm for the Generalized Steiner... |
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
COCOON
2011
Springer
12 years 7 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
AINA
2007
IEEE
14 years 1 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
OL
2011
13 years 2 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
WAOA
2005
Springer
14 years 25 days ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...