Minimum cost source location problems with flow requirements

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3887 LNCS, Issue , 2006, Pages 769-780

  Sakashita, Mariko ^a   Makino, Kazuhisa ^b   Fujishige, Satoru ^a  

^a KYOTO UNIVERSITY   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

Approximation algorithm; Combinatorial optimization; Connectivity; Location problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; NUMERICAL ANALYSIS; POLYNOMIALS;

APPROXIMATION ALGORITHM; COMBINATORIAL OPTIMIZATION; CONNECTIVITY; LOCATION PROBLEM;

PROBLEM SOLVING;

EID: 33745585076     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11682462_70     Document Type: Conference Paper

References (19)

1. K. Andreev, C. Garrod, and B. Maggs: Simultaneous source location, SCS Technical Report CMU-CS-03-162, Carnegie Mellon University, Pittsburgh.
2. K. Arata, S. Iwata, K. Makino, and S. Fujishige: Locating sources to meet flow demands in undirected networks, J. Algorithms, 42 (2002), 54-68.
3. M. Bárász, J. Becker, and A. Frank: An algorithm for source location in directed graphs, Operations Research Letters, 33 (2005), 221-230.
4. U. Feige: A threshold of Inn for approximating set cover, J. ACM, 45 (1998), 634-652.
5. T. Fujito: Approximation algorithms for submodular set cover with applications, IEICE Trans., E83-D (2000), 480-487.
6. A. Goel and D. Estrin: Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk, Proceedings of 14th Annual ACM-SIAM Symposium on Discrete Algorithms (2003), 499-505.
7. M. R. Garey and D. S. Johnson: Computers and Intractability: A Guide to the Theory NP-Completeness, Freeman, New York, 1979.
8. J. van den Heuvel and M. Johnson: Transversals of subtree hypergraphs and the source location problem in digraphs, CD AM Research Report, LSE-CDAM-200410, London School of Economics.
9. T. Ishii, H. Fujita, and H. Nagamochi: Minimum cost source location problem with local 3-vertex-connectivity requirements, Computing Theory: The Australian Theory Symposium, (2005), 97-105.
10. H. Ito, M. Ito, Y. Itatsu, H. Uehara, and M. Yokoyama: Source location problems considering vertex-connectivity and edge-connectivity simultaneously, Networks, 40 (2002), 63-70.
11. H. Ito, K. Makino, K. Arata, S. Honami, Y. Itatsu, and S. Fujishige: Source location problem with flow requirements in directed networks, Optimization Methods and Software, 18 (2003), 427-435.
12. M. Labbe, D. Peeters, and J.-F. Thisse: Location on networks, In M. O. Ball et al. (eds.), Handbooks in OR & MS, 8, North-Holland (1995), 551-624.
13. C. Lund and M. Yannakakis: On the hardness of approximating minimization problems, J. ACM, 41 (1994), 960-981.
14. H. Nagamochi, T. Ishii, and H. Ito: Minimum cost source location problem with vertex-connectivity requirements in digraphs, Information Processing Letters, 80 (2001), 287-294.
15. M. Sakashita, K. Makino, and S, Fujishige: Minimizing a monotone concave function with laminar covering constraints, ISAAC2005, LNCS 3827 (2005), 71-81.
16. M. Sakashita, K. Makino, and S. Fujishige: Minimum cost source location problems with flow requirements, unpublished manuscript.
17. H. Tamura, M. Sengoku, S. Shinoda, and T. Abe: Location problems on undirected flow networks, IEICE Trans., E73 (1990), 1989-1993.
18. H. Tamura, M. Sengoku, S. Shinoda, and T. Abe: Some covering problems in location theory on flow networks, IEICE Trans., E75-A (1992), 678-683.
19. L.A. Wolsey: An analysis of the greedy algorithm for the submodular set covering problem, Combinatorica, 2 (1982), 385-393.