140 search results - page 4 / 28 » Computing Minimum Spanning Trees with Uncertainty |
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
CSR
2008
Springer
14 years 9 months ago
2008
Springer
SPAA
1998
ACM
15 years 1 months ago
1998
ACM
104
click to vote
ICPADS
2007
IEEE
15 years 3 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...