Abstract
In this paper, we consider source location problems and their generalizations with three connectivity requirements λ, κ and \({\hat\kappa}\). We show that the source location problem with edge-connectivity requirement λ in undirected networks is strongly NP-hard, and that no source location problems with three connectivity requirements in undirected/directed networks are approximable within a ratio of O(ln D), unless NP has an O(N loglogN)-time deterministic algorithm. Here D denotes the sum of given demands. We also devise (1+ln D)-approximation algorithms for all the extended source location problems if we have the integral capacity and demand functions.
Furthermore, we study the extended source location problems when a given graph is a tree. Our algorithms for all the extended source location problems run in pseudo-polynomial time and the ones for the source location problem with vertex-connectivity requirements κ and \({\hat\kappa}\) run in polynomial time, where pseudo-polynomiality for the source location problem with the arc-connectivity requirement λ is best possible unless P=NP, since it is known to be weakly NP-hard, even if a given graph is a tree.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andreev, K., Garrod, C., Maggs, B.: Simultaneous source location, SCS Technical Report CMU-CS-03-162, Carnegie Mellon University, Pittsburgh
Arata, K., Iwata, S., Makino, K., Fujishige, S.: Locating sources to meet flow demands in undirected networks. J. Algorithms 42, 54–68 (2002)
Bárász, M., Becker, J., Frank, A.: An algorithm for source location in directed graphs. Operations Research Letters 33, 221–230 (2005)
Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45, 634–652 (1998)
Fujito, T.: Approximation algorithms for submodular set cover with applications. IEICE Trans. E83-D, 480–487 (2000)
Goel, A., Estrin, D.: Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk. In: Proceedings of 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 499–505 (2003)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory NP-Completeness. Freeman, New York (1979)
van den Heuvel, J., Johnson, M.: Transversals of subtree hypergraphs and the source location problem in digraphs, CDAM Research Report, LSE-CDAM-2004-10, London School of Economics
Ishii, T., Fujita, H., Nagamochi, H.: Minimum cost source location problem with local 3-vertex-connectivity requirements. In: Computing Theory: The Australian Theory Symposium, pp. 97–105 (2005)
Ito, H., Ito, M., Itatsu, Y., Uehara, H., Yokoyama, M.: Source location problems considering vertex-connectivity and edge-connectivity simultaneously. Networks 40, 63–70 (2002)
Ito, H., Makino, K., Arata, K., Honami, S., Itatsu, Y., Fujishige, S.: Source location problem with flow requirements in directed networks. Optimization Methods and Software 18, 427–435 (2003)
Labbe, M., Peeters, D., Thisse, J.-F.: Location on networks. In: Ball, M.O., et al. (eds.) Handbooks in OR & MS, vol. 8, pp. 551–624. North-Holland, Amsterdam (1995)
Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41, 960–981 (1994)
Nagamochi, H., Ishii, T., Ito, H.: Minimum cost source location problem with vertex-connectivity requirements in digraphs. Information Processing Letters 80, 287–294 (2001)
Sakashita, M., Makino, K., Fujishige, S.: Minimizing a monotone concave function with laminar covering constraints. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 71–81. Springer, Heidelberg (2005)
Sakashita, M., Makino, K., Fujishige, S.: Minimum cost source location problems with flow requirements (unpublished manuscript)
Tamura, H., Sengoku, M., Shinoda, S., Abe, T.: Location problems on undirected flow networks. IEICE Trans. E73, 1989–1993 (1990)
Tamura, H., Sengoku, M., Shinoda, S., Abe, T.: Some covering problems in location theory on flow networks. IEICE Trans. E75-A, 678–683 (1992)
Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2, 385–393 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakashita, M., Makino, K., Fujishige, S. (2006). Minimum Cost Source Location Problems with Flow Requirements. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_70
Download citation
DOI: https://doi.org/10.1007/11682462_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)