13 search results - page 2 / 3 » Budget Constrained Minimum Cost Connected Medians |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
GLOBECOM
2008
IEEE
15 years 4 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...
108
click to vote
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
104
click to vote
SODA
1992
ACM
14 years 10 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
ICCAD
2004
IEEE
15 years 6 months ago
2004
IEEE
This paper presents the Routing Cost Valleys (RCV) algorithm – the first published algorithm that simultaneously optimizes all short- and long-path timing constraints in a Field...