Abstract
This paper considers the problem of selecting a minimum communication spanning tree (MCT) for a given weighted network, namely, a tree that minimizes the total cost of transmitting a given set of communication requirements between n sites over the tree edges [8]. A slightly stronger formulation of the problem [1] is based on the concept of a minimum average stretch spanning tree (MAST) for weighted connected multigraphs. In particular, a ρ-solution for the MAST problem (namely, an algorithm for constructing a spanning tree with average stretch ρ) in the special case of complete weighted graphs implies an approximation algorithm for the MCT problem with approximation ratio ρ.
It is conjectured in [1] that for any given weighted multigraph there exists a spanning tree with average stretch O(log n) (which is the best possible, in view of the Ω(log n) lower bound given therein). However, the (deterministic) construction presented (which is the best construction to date) yields only a bound of exp(O(√ log n log log n)) on the average stretch. For the restricted case of complete weighted graphs, there is a better, albeit randomized, construction yielding average stretch O(log2 n) [2]. This implies a randomized approximation algorithm for MCT with the same ratio.
This paper presents a deterministic algorithm that for every weighted complete multigraph constructs a spanning tree whose average stretch is bounded by O(log2 n). This yields a deterministic polynomial-time approximation algorithm for MCT with ratio O(log2 n). In addition, our solution approach confirms the conjecture of [1] in the special case of d-dimensional Euclidean complete multigraphs for fixed d, where our construction yields spanning trees with O(log n) average stretch.
Supported in part by grants from the Israel Science Foundation and from the Israel Ministry of Science and Art.
Preview
Unable to display preview. Download preview PDF.
References
N. Alon, R.M. Karp, D. Peleg, and D. West. A graph-theoretic game and its application to the k-server problem. SIAM J. on Computing, pages 78–100, 1995.
Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proc. 37th IEEE Symp. on Foundations of Computer Science, pages 184–193, 1996.
Y. Bartal. On approximating arbitrary metrics by tree metrics. To appear in Proc. 30th Annual ACM Symp. on Theory of Computer Science.
J. Bourgain. On Lipschitz embeddings of finite metric spaces in Hilbert spaces. Israel J. Math., pages 46–52, 1985.
M. Charikar, C. Chekuri, A. Goel, and S. Guha. Rounding via trees: deterministic approximation algorithms for group steiner trees and k-median. To appear in Proc. 30th Annual ACM Symp. on Theory of Computer Science.
G. Even, J. Naor, S. Rao, and B. Schieber. Divide-and-conquer approximation algorithms via spreading metrics. In Proc. 36th IEEE Symp. on Foundations of Computer Science, pages 62–71, October 1995.
M.R. Garey and D.S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completness. W. H. Freeman and Co., San Francisco, CA, 1979.
T.C. Hu. Optimum communication spanning trees. SIAM J. on Computing, pages 188–195, 1974.
P. Indyk, R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality (preliminary version). To appear in Proc. 30th Annual ACM Symp. on Theory of Computer Science.
P. Indyk. Private Communication.
D.S. Johnson, J.K. Lenstra, and A.H.G. Rinnooy-Kan. The complexity of the network design problem. Networks, 8:275–285, 1978.
A. Kershenbaum. Telecommunications network design algorithms. McGraw-Hill Book Co., 1993.
N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215–245, 1995.
D. Peleg. Approximating minimum communication spanning trees. In Proc. 4th Colloq. on Structural Information & Communication Complexity, July 1997.
P.D. Seymour. Packing directed circuites fractionally. Combinatorica, 15:2 281–288, 1995.
B.Y. Wu, G. Lancia, Y. Bafna, K.M. Chao, R. Ravi, and C.Y. Tang. A polynomial time approximation scheme for minimum routing cost spanning trees. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, pages 21–32, January 1998.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peleg, D., Reshef, E. (1998). Deterministic polylog approximation for minimum communication spanning trees. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055092
Download citation
DOI: https://doi.org/10.1007/BFb0055092
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64781-2
Online ISBN: 978-3-540-68681-1
eBook Packages: Springer Book Archive