791 search results - page 61 / 159 » Approximating the Maximum Sharing Problem |
JCO
2006
13 years 7 months ago
2006
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
Abstract—Wireless sensor networks are evolving from singleapplication platforms towards an integrated infrastructure shared by multiple applications. Given the resource constrain...
MFCS
2009
Springer
14 years 8 days ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
SIAMCOMP
2000
13 years 7 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
We pose the problem of tracing traitors, who have colluded to circumvent a multimedia fingerprinting system, as a sparse underdetermined linear problem. We propose a range of det...