MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees
In this paper, we consider an interesting variant of the well-known Steiner tree problem: Given a complete graph G = (V,E) with a cost function c:E →R + and two subsets R and R′ satisfying R′ ⊂ R ⊆ V, a selected-internal Steiner tree is a Steiner tree which contains (or spans) all the vertices in R such that each vertex in R′ cannot be a leaf. The selected-internal Steiner tree problem is to find a selected-internal Steiner tree with the minimum cost. In this paper, we show that the problem is MAX SNP-hard even when the costs of all edges in the input graph are restricted to either 1 or 2. We also present an approximation algorithm for the problem.
KeywordsCost Function Approximation Algorithm Complete Graph Steiner Tree Internal Vertex
Unable to display preview. Download preview PDF.
- 4.Cheng, X., Du, D.Z.: Steiner Trees in Industry. Kluwer Academic Publishers, Dordrecht (2001)Google Scholar
- 6.Karp, R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972); 5 Information Processing Letters, vol. 84(2), pp. 103–107Google Scholar
- 8.Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 770–779 (2000)Google Scholar
- 9.West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)Google Scholar