632 search results - page 54 / 127 » On the Approximability of the Steiner Tree Problem |
ISAAC
2003
Springer
14 years 2 months ago
2003
Springer
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
FOCS
1996
IEEE
14 years 1 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...
APPROX
2004
Springer
14 years 2 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
TAMC
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...