667 search results - page 37 / 134 » Approximation algorithms for connected facility location pro... |
121
click to vote
GLOBECOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
113
click to vote
INFORMS
2008
15 years 3 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
123
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
117
click to vote
SIROCCO
2004
15 years 4 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
104
click to vote
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...