Simultaneous source location

ACM Transactions on Algorithms

Volumn 6, Issue 1, 2009, Pages

  Andreev, Konstantin ^a   Garrod, Charles ^b   Golovin, Daniel ^b   Maggs, Bruce ^b   Meyerson, Adam ^c  

^a Chatham Financial   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithms; Submodular cover

Indexed keywords

ANALYSIS OF ALGORITHMS; BOUNDED TREEWIDTH; COMBINATORIAL ALGORITHM; DESCRIPTORS; DISCRETE MATHEMATICS; EDGE CAPACITY; EXACT ALGORITHMS; GRAPH ALGORITHMS; HARDNESS RESULT; NETWORK PROBLEMS; NONNUMERICAL ALGORITHMS AND PROBLEMS; NP-HARD; PROBLEM COMPLEXITY; SOURCE LOCATION; SUBMODULAR; SUBMODULAR COVER; TREE-WIDTH; UNDIRECTED GRAPH;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LOCATION; MATHEMATICAL TECHNIQUES;

APPROXIMATION ALGORITHMS;

EID: 74049084143     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1644015.1644031     Document Type: Article

References (27)

1. ARATA, K., IWATA, S., MAKINO, K., AND FUJISHIGE, S. 2002. Locating sources to meet flow demands in undirected networks. J. Algor. 42, 1, 54-68.
2. ARYA, V., GARG, N., KHANDEKAR, R., MEYERSON, A., MUNAGALA, K., AND PANDIT, V. 2004. Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33, 3, 544-562.
3. AZAR, Y., COHEN, E., FIAT, A., KAPLAN, H., AND RACKE, H. 2003. Optimal oblivious routing in polynomial time. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC'03). ACM, New York, 383-388.
4. BAR-ILAN, J., KORTSARZ, G., AND PELEG, D. 2001. Generalized submodular cover problems and applications. Theor. Comput. Sci. 250, 1-2, 179-200.
5. BÁRÁSZ, M., BECKER, J., AND FRANK, A. 2005. An algorithm for source location in directed graphs. Oper. Res. Lett. 33, 3, 221-230.
6. BIENKOWSKI, M., KORZENIOWSKI, M., AND RÄCKE, H. 2003. A practical algorithm for constructing oblivious routing schemes. In Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'03). ACM, New York, 24-33.
7. BODLAENDER, H. L. 1997. Treewidth: Algorithmic techniques and results. In Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS'97). Springer, 19-36.
8. BODLAENDER, H. L. 1998. A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209, 1-2, 1-45.
9. FORD, L. R., AND FULKERSON,D.R. 1956. Maximal flowthrough a network. Canad. J. Math. 8, 399-404.
10. HARRELSON, C., HILDRUM, K., AND RAO, S. 2003. A polynomial-time tree decomposition to minimize congestion. In Proceedings of the 15th Annual ACMSymposium on Parallel Algorithms and Architectures (SPAA'03). ACM, New York, 34-43.
11. KORTSARZ, G. AND NUTOV, Z. 2006. A note on two source location problems. Manuscript.
12. MAHDIAN, M., YE, Y., AND ZHANG, J. 2002. Improved approximation algorithms for metric facility location problems. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX'02). Springer, 229-242.
13. NAGAMOCHI, H., ISHII, T., AND ITO, H. 2001. Minimum cost source location problem with vertexconnectivity requirements in digraphs. Inform. Process. Lett. 80, 6, 287-293.
14. PÁL, M., EVA TARDOS, AND WEXLER, T. 2001. Facility location with nonuniform hard capacities. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS'01). IEEE Computer Society, Washington, DC, 329.
15. RÄCKE, H. 2002. Minimizing congestion in general networks. In Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS'02). IEEE Computer Society, Los Alamitos, CA, 43-52.
16. RAZ, R., AND SAFRA, S. 1997. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC'97). ACM Press, New York, 475-484.
17. ROBERTSON, N. AND SEYMOUR, P. D. 1986. Graph minors. II. Algorithmic aspects of tree-width. J. Algor. 7, 3, 309-322.
18. SAKASHITA, M., MAKINO, K., AND FUJISHIGE, S. 2006a. Minimum cost source location problems with flowrequirements. In Proceedings of the Latin American Symposium on Theoretical Informatics (LATIN). 769-780.
19. SAKASHITA, M., MAKINO, K., NAGAMOCHI, H., AND FUJISHIGE, S. 2006b. Minimum transversals in posi-modular systems. In Proceedings of the 14th Conference on Annual European Symposium (ESA'06). Springer, 576-587.
20. SCHRIJVER, A. 2003. Combinatorial Optimization: Polyhedra and Efficiency. volume B, Matroids, Trees, Stable Sets, Chapters 39-69. Springer.
21. SHMOYS, D. B., ÉVA TARDOS, AND AARDAL, K. 1997. Approximation algorithms for facility location problems. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing. 265-274.
22. SWAMY, C., AND PÁL, M. 2006. Personal communication.
23. TAMURA, H., SENGOKU, M., SHINODA, S., AND ABE, T. 1990. Location problems on undirected flow networks. IEICE Trans. Comm. Electron. Inf. Syst. E73, 12, 1989-1993.
24. TAMURA, H., SENGOKU,M., SHINODA, S., ANDABE, T. 1992. Some covering problems in location theory on flow networks. IEICE Trans. Fundam. Electron. Comm. Comput. Sci. E75-A, 6, 678-684.
25. TAMURA, H., SUGAWARA, H., SENGOKU, M., AND SHINODA, S. 1996. On a generalization of a covering problem on undirected flow networks. In Proceedings of the IEEE Asia Pacific Conference on Circuits and Systems. 460-463.
26. VAN DEN HEUVEL, J., AND JOHNSON, M. 2008. Transversals of subtree hypergraphs and the source location problem in digraphs. Netw. 51, 2, 113-119.
27. WOLSEY, L. A. 1982. An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2, 4, 385-393.