Abstract
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S⊂eqV in a weighted graph G = (V,E,c), c:E→ R+. In this paper we consider a generalization of the Steiner tree problem, so called Polymatroid Steiner Problem, in which a polymatroid P = P(V) is defined on V and the Steiner tree is required to span at least one base of P (in particular, there may be a single base S⊂eqV). This formulation is motivated by the following application in sensor networks – given a set of sensors S = {s1,…,s k }, each sensor s i can choose to monitor only a single target from a subset of targets X i , find minimum cost tree spanning a set of sensors capable of monitoring the set of all targets X = X1 ∪ … ∪ X k . The Polymatroid Steiner Problem generalizes many known Steiner tree problem formulations including the group and covering Steiner tree problems. We show that this problem can be solved with the polylogarithmic approximation ratio by a generalization of the combinatorial algorithm of Chekuri et al. (2002).
We also define the Polymatroid directed Steiner problem which asks for a minimum cost arborescence connecting a given root to a base of a polymatroid P defined on the terminal set S. We show that this problem can be approximately solved by algorithms generalizing methods of Chekuri et al. (2002).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Y. Bartal, “Probabilistic approximation of metric spaces and its algorithmic applications,” in FOCS, 1996.
Y. Bartal, “On approximating arbitrary metrics by tree metrics,” in STOC, 1998.
P. Berman, G. Calinescu, C. Shah, and A. Zelikovsky, “Power efficient monitoring management in sensor networks,” in Proc. IEEE Wireless Communications and Networking Conference, 2004.
G. Calinescu, S. Kapoor, A. Olshevsky, and A. Zelikovsky, “Network lifetime and power assignment in ad-hoc wireless networks,” in Proc. 11th European Symposium on Algorithms, 2003.
M. Charikar, C. Chekuri, A. Goel, and S. Guha, “Approximating a finite metric by a small number of tree metrics,” in STOC, 1999.
M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, “Approximation algorithms for directed steiner problems,” Journal of Algorithms, vol. 33, no. 1, pp. 73–91, 1999.
C. Chekuri, G. Even, and G. Kortsarz, “A combinatorial approximation algorithm for the group Steiner problem,” 2002. Submitted for publication. Available on the web.
G. Even, G. Kortsarz, and W. Slany, “On network design: Fixed charge flows and the covering Steiner problem,” in SWAT 2002, pp. 318–329, 2002.
J. Fakcharoenphol, S. Rao, and K. Talwar, “A tight bound on approximating arbitrary metrics by tree metrics,” in STOC, 2003.
N. Garg, G. Konjevod, and R. Ravi, “A polylogarithmic approximation algorithm for the Group Steiner Tree problem,” J. Algorithms, vol. 37, no. 1, pp, 66–84, 2000.
N. Garg and J. Konemann, “Faster and simpler algorithms for multicommodity flow and other fractional packing problems,” in IEEE Symposium on Foundations of Computer Science, 1998, pp. 300–309.
A. Gupta and A Srinivasan, “On the covering steiner problem,” in em Proc. Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2003, pp. 244–251.
E. Halperin, G. Kortsarz, R. Krauthgamer, A. Srinivasan, and N. Wang, “Integrality ratio for Group Steiner Trees and Directed Steiner Trees,” in 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2003, pp. 275–284.
E. Halperin and R. Krauthgamer, “Polylogarithmic inapproximability,” in Proceedings of the 35th ACM Symposium on Theory of Computing, 2003, pp. 585–594.
C. H. Helvig, G. Robins, and A. Zelikovsky, “Improved approximation scheme for the group Steiner problem,” Networks, vol. 37, no. 1, pp. 8–20, 2001.
G. Konjevod, R. Ravi, and A. Srinivasan. “Approximation algorithms for the covering Steiner problem,” Random Structures and Algorithms, vol. 20, no. 3, pp. 465–482, 2002. Preliminary version by Konjevod and Ravi in SODA 2000.
G. Konjevod and R. Ravi, “An approximation algorithm for the covering Steiner problem,” in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2000, pp. 338–344.
L.A. Wolsey, “Analysis of the greedy algorithm for the submodular set covering problem,” Combinatorica, vol. 2, no. 385–392, 1982.
A. Zelikovsky, “A series of approximation algorithms for the acyclic Directed Steiner Tree problem,” Algorithmica, vol. 18, 1997.
L. Zosin and S. Khuller, “On Directed Steiner Trees,” in SODA, 2002, pp. 59–63.
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper appeared in ISAAC 2004
Rights and permissions
About this article
Cite this article
Calinescu, G., Zelikovsky, A. The Polymatroid Steiner Problems. J Comb Optim 9, 281–294 (2005). https://doi.org/10.1007/s10878-005-1412-9
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10878-005-1412-9