A Tight Lower Bound for the Steiner Point Removal Problem on Trees
Gupta (SODA’01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edge-weighted tree T S on the vertex set S such that the distortion of the distances between vertices in S is small. His algorithm guarantees that for any finite tree, the distortion incurred is at most 8. Moreover, a family of trees, where the leaves are the terminals, is presented such that the distortion incurred by any algorithm for SPR is at least 4(1 – o(1)). In this paper, we close the gap and show that the upper bound 8 is essentially tight. In particular, for complete binary trees in which all edges have unit weight, we show that the distortion incurred by any algorithm for the SPR problem must be at least 8 (1 – o(1)).
KeywordsMinor Mapping Outerplanar Graph Complete Binary Tree Minor Transformation Edge Contraction
Unable to display preview. Download preview PDF.
- 1.Gupta, A.: Steiner points in tree metrics don’t (really) help. In: SODA, pp. 220–227 (2001)Google Scholar
- 3.Chu, Y., Rao, S., Zhang, H.: A case for end system multicast. In: Proceedings of ACM Sigmetrics, Santa Clara, CA (2000)Google Scholar
- 4.Xie, J., Talpade, R.R., Mcauley, A., Liu, M.: Amroute: ad hoc multicast routing protocol. Mob. Netw. Appl. 7(6) (2002)Google Scholar
- 5.Chawathe, Y.: Scattercast: an adaptable broadcast distribution framework. Multimedia Syst. 9(1) (2003)Google Scholar
- 6.Francis, P.: Yoid: Extending the internet multicast architecture (2000)Google Scholar
- 7.Chekuri, C., Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Embedding k-outerplanar graphs into ℓ1. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 527–536 (2003)Google Scholar
- 9.Archer, A., Fakcharoenphol, J., Harrelson, C., Krauthgamer, R., Talwar, K., Tardos, E.: Approximate classification via earthmover metrics. In: 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1072–1080 (2004)Google Scholar
- 10.Elkin, M., Emek, Y., Spielman, D.A., Teng, S.-H.: Lower-stretch spanning trees. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 494–503 (2005)Google Scholar
- 11.Dhamdhere, K., Gupta, A., Räcke, H.: Improved embeddings of graph metrics into random treesGoogle Scholar