106 search results - page 12 / 22 » Approximating Spanning Trees with Inner Nodes Cost |
119
click to vote
SODA
1992
ACM
15 years 25 days ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
108
Voted
JSAC
2007
14 years 11 months ago
2007
— The advances in wavelength-division multiplexing (WDM) technology are expected to facilitate bandwidth-intensive multicast applications. A single fiber failure in such a netwo...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
137
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
75
Voted
APPROX
2007
Springer
15 years 3 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...