628 search results - page 5 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
107
click to vote
ISITA
2010
14 years 9 months ago
2010
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
FOCS
1996
IEEE
15 years 3 months ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
112
click to vote
NETWORKS
2006
14 years 11 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
128
click to vote
PDCAT
2005
Springer
15 years 5 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
113
click to vote
ESA
2005
Springer
15 years 5 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...