628 search results - page 60 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
109
click to vote
APPROX
2007
Springer
15 years 7 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
130
click to vote
MP
2007
15 years 2 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
124
Voted
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
107
click to vote
SOFSEM
1997
Springer
15 years 7 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
144
click to vote
NETWORKING
2008
15 years 4 months ago
2008
Abstract. To support large-scale live Internet broadcasting services efficiently in content delivery networks (CDNs), it is essential to exploit peer-to-peer capabilities among end...