Maximum-cover source-location problems

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E89-A, Issue 5, 2006, Pages 1370-1377

  Sugihara, Kenya ^a   Ito, Hiro ^a,b,c  

^a KYOTO UNIVERSITY   (Japan)

^b Inst Operations Res and Mgmt Sci   (Japan)

^c IPSJ   (Japan)

Author keywords

Edge connectivity; Graph; Location problem; NP hard; Polynomial time algorithm

Indexed keywords

ALGORITHMS; EDGE DETECTION; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

EDGE-CONNECTIVITY; GRAPH; LOCATION PROBLEM; NP-HARD; POLYNOMIAL-TIME ALGORITHMS;

GRAPH THEORY;

EID: 33646795295     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e89-a.5.1370     Document Type: Article

References (13)

1. K. Arata, S. Iwata, K. Makino, and S. Fujishige, "Locating sources to meet flow demands in undirected networks," J. Algorithms, vol.42, pp.54-68, 2002.
2. M. Bárász, J. Becker, and A. Frank, "An algorithm for source location in directed graphs," EGRES Technical Report, no.2004-06, 2004.
3. M. Blum, R. Floyd, V. Platt, R. Rivest, and R. Tarjan, "Time bounds for selection," J. Comput. Syst. Sci., vol.7, pp.448-461, 1972.
4. G. Cornuejols, M.L. Fisher, and G.L. Nemhauser, "Location of bank accounts to optimize float; An analytic study exact and approximate algorithms," Manage. Sci., vol.23, pp.789-810, 1977.
5. E.A. Dinits, A.V. Karzanov, and M.V. Lomonosov, "On the structure of a family of minimal weighted cuts in a graph," in Studies in Discrete Optimization, ed. A.A. Fridman, pp.290-306, Nauka, Moscow, 1976.
6. 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, vol.18, no.4, pp.427-435, Aug. 2003.
7. H. Ito, H. Uehara, and M. Yokoyama, "A faster and flexible algorithm for a location problem on undirected flow networks," IEICE Trans. Fundamentals, vol.E83-A, no.4, pp.704-712, April 2000.
8. H. Ito and M. Yokoyama, "Edge connectivity between nodes and node-subsets," Networks, vol.31, pp.157-164, 1998.
9. 2 log n) time and O(m) space," IEICE Trans. Fundamentals, vol.E86-D, no.2, pp. 179-185, Feb. 2003.
10. R. Raz and S. Safra, "A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP," Proc. 29th Annual ACM Symposium on Theory of Computing, pp.475-484, 1997.
11. H. Tamura, M. Sengoku, S. Shinoda, and T. Abe, "Location problems on undirected flow networks," IEICE Trans., vol.E73, no.12, pp. 1989-1993, Dec. 1990.
12. R.E. Tarjan, "A note on finding the bridges of a graph," Inf. Process. Lett., vol.2, pp.160-161, 1974.
13. R. Uehara and Y. Uno, "Efficient algorithms for the longest path problem," LNCS, vol.3341, pp.871-883, 2004.