37 search results - page 6 / 8 » mst 2008 |
87
Voted
TPDS
2008
14 years 10 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
105
Voted
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
104
click to vote
MST
2011
14 years 5 months ago
2011
Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erd˝os-R´enyi random graph G(n, p) starting from a set of vertices that are convinced of the message...
87
Voted
SIAMCOMP
2008
14 years 10 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
63
Voted
WCE
2007
14 years 11 months ago
2007
— The strength of Micro Systems Technology (MST) is the ability to fabricate a large number of small devices economically. However such devices tend to have errors caused by the ...