26 search results - page 4 / 6 » Probabilistic Analysis of the Degree Bounded Minimum Spannin... |
MONET
2006
13 years 7 months ago
2006
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
ICPP
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, we propose a new protocol called Shared Tree Streaming (or STS in short) protocol that is designed for interactive multimedia streaming applications. STS is a decen...
STOC
1996
ACM
13 years 11 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
STOC
2010
ACM
14 years 9 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...