970 search results - page 148 / 194 » On encodings of spanning trees |
CPAIOR
2010
Springer
14 years 3 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
STACS
2001
Springer
14 years 3 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
STACS
2001
Springer
14 years 3 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
INFOCOM
1999
IEEE
14 years 3 months ago
1999
IEEE
Abstract--We explore the use of end-to-end multicast traffic as measurement probes to infer network-internal characteristics. We have developed in an earlier paper [2] a Maximum Li...
INFOCOM
1999
IEEE
14 years 3 months ago
1999
IEEE
There is an increasing need for Internet hosts to be able to quickly and efficiently learn the distance, in terms of metrics such as latency or bandwidth, between Internet hosts. ...