710 search results - page 55 / 142 » On Minimum Power Connectivity Problems |
APPROX
2008
Springer
13 years 9 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...
DAM
2007
13 years 7 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We explore several fundamental questions at the intersection of sampling theory and information theory. In particular, we study how capacity is affected by a given sampling mechan...
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 ...
ACCESSNETS
2008
Springer
14 years 2 months ago
2008
Springer
An indoor power line is one of the most attractive media for in-home networks. However, there are many technical problems for achieving in-home power line communication (PLC) with ...