628 search results - page 37 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
116
Voted
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
132
Voted
IJCM
2002
15 years 2 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
155
click to vote
COLT
2010
Springer
15 years 19 days ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
112
Voted
JCO
2008
15 years 2 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
125
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...