Abstract
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an exact algorithm for trees and show how this can be combined with a result of Räcke to give a solution that exceeds edge capacities by at most O(log2 n log logn), where n is the number of nodes. On graphs of bounded treewidth, we show the problem is still NP-Hard, but we are able to give a PTAS with at most O(1+ε) violation of the capacities, or a (k+1)-approximation with exact capacities, where k is the treewidth and ε can be made arbitrarily small.
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
Aiello, W.A., Leighton, F.T., Maggs, B.M., Newman, M.: Fast algorithms for bit-serial routing on a hypercube. Mathematical Systems Theory (1991)
Arata, K., Iwata, S., Makino, K., Fujishige, S.: Locating sources to meet flow demands in undirected networks. Journal of Algorithms 42 (2002)
Arya, V., Garg, N., Khandekar, R., Pandit, V., Meyerson, A., Munagala, K.: Local search heuristics for k-median and facility location problems. In: Proceedings of the 33rd ACM Symposium on Theory of Computing (2001)
Aumann, Y., Rabani, Y.: An O(log k) approximate mincut max-flow theorem and approximation algorithms. SIAM Journal of Computing 27(1) (1998)
Azar, Y., Cohen, E., Fiat, A., Kaplan, H., Räcke, H.: Optimal oblivious routing in polynomial time. In: Proc. 35th Annual ACM Symposium on Theory of Computing (2003)
Bienkowski, M., Korzeniowski, M., Räcke, H.: A practical algorithm for constructing oblivious routing schemes. In: Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures (2003)
Bodlaender, H.L.: Treewidth: Algorithmic Techniques and Results. In: Proceedings 22nd International Symposium on Mathematical Foundations of Computer Science (1997)
Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Compututer Science 209(1) (1998)
Dinur, I., Safra, S.: On the importance of being biased. In: Proceedings of the 34rd ACM Symposium on Theory of Computing (2002)
Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM (1995)
Harrelson, C., Hildrum, K., Rao, S.: A polynomial-time tree decomposition to minimize congestion. In: Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures (2003)
Hastad, J.: Some optimal inapproximability results. In: Proceedings 29th Ann. ACM Symp. on Theory of Computing, pp. 1–10. ACM, New York (1997)
Klein, P., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: Proceedings of the 25th ACM Symp. on Theory of Computing (1993)
Leighton, T., Rao, S.: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: Proceedings of the 29th Symp. on Foundations of Computer Science (1988)
S. Khot and O. Regev. Vertex cover might be hard to approximate within 2 − ε . Proceedings of the 17th IEEE Conference on Computational Complexity, 2002.
Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, p. 229. Springer, Heidelberg (2002)
Pál, M., Tardos, É., Wexler, T.: Facility location with nonuniform hard capacities. In: Proceedings of the 42nd IEEE Symposium on the Foundations of Computer Science (2001)
Räcke, H.: Minimizing congestion in general networks. In: IEEE Symposium on Foundations of Computer Science (2002)
Robertson, N., Seymour, P.D.: Graph Minors II. Algorithmic aspects of tree width. Journal of Algorithms 7 (1986)
Shmoys, D., Tardos, É., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the 29th ACM Symposium on Theory of Computing (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andreev, K., Garrod, C., Maggs, B., Meyerson, A. (2004). Simultaneous Source Location. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 2004 2004. Lecture Notes in Computer Science, vol 3122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27821-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-27821-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22894-3
Online ISBN: 978-3-540-27821-4
eBook Packages: Springer Book Archive