312 search results - page 3 / 63 » Degree Bounded Network Design with Metric Costs |
ICNP
2003
IEEE
13 years 10 months ago
2003
IEEE
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as ¢¤£¦¥¨§© , which is prohibitive i...
ISCAS
2003
IEEE
13 years 10 months ago
2003
IEEE
A new theoretical approach for designing a low-noise amplifier (LNA) for the ultra-wideband (UWB) radio is presented. Unlike narrowband systems, the use of the noise figure (NF) p...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
APPROX
2008
Springer
13 years 6 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...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...