74 search results - page 3 / 15 » Approximating the Degree-Bounded Minimum Diameter Spanning T... |
ENDM
2008
13 years 5 months ago
2008
GECCO
2009
Springer
13 years 12 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
FAW
2010
Springer
13 years 5 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
ICPP
2005
IEEE
13 years 11 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...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...