140 search results - page 18 / 28 » Computing Minimum Spanning Trees with Uncertainty |
108
click to vote
LCN
2006
IEEE
15 years 5 months ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
118
click to vote
AINA
2005
IEEE
15 years 5 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
ESA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a software library Stxxl, that enables practiceoriented experimentation with huge data sets. Stxxl is an implementation of the C++ standard template library ST...
101
click to vote
STOC
2003
ACM
15 years 12 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...
PODC
2005
ACM
15 years 5 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...