140 search results - page 4 / 28 » Computing Minimum Spanning Trees with Uncertainty |
114
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
115
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
119
Voted
CSR
2008
Springer
15 years 3 months ago
2008
Springer
123
Voted
SPAA
1998
ACM
15 years 7 months ago
1998
ACM
153
Voted
ICPADS
2007
IEEE
15 years 10 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...