Management Science and Financial Engineering

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

An Algorithm for the Graph Disconnection Problem

  • Myung Young-Soo (Department of Business Administration, Dankook University) ;
  • Kim Hyun-joon (Department of Management Information Systems, University of Ulsan)
  • Published : 2005.05.01
Download PDF
⟨ Previous Next ⟩

Abstract

We consider the graph disconnection problem, which is to find a set of edges such that the total cost of destroying the edges is no more than a given budget and the weight of nodes disconnected from a designated source by destroying the edges is maximized. The problem is known to be NP-hard. We present an integer programming formulation for the problem and develop an algorithm that includes a preprocessing procedure for reducing the problem size, a heuristic for providing a lower bound, and a cutting plane algorithm for obtaining an upper bound. Computational results for evaluating the performance of the proposed algorithm are also presented.

Keywords

References

  1. Ahuja, R. K., T. L. Magnanti and J. B. Orlin, Network Flows, Prentice Hall, New Jersey, 1993
  2. Cosares, S., N. D. Deutch, I. Saniee, and O. J. Wasem, 'SONET toolkit: A decision support system for designing robust and cost-effective fiber-optic networks,' Interfaces 25 (1995), 20-40 https://doi.org/10.1287/inte.25.1.20
  3. Cunningham, W. H., 'Optimal attack and reinforcement of a network,' Journal of the ACM 32 (1985), 549-561 https://doi.org/10.1145/3828.3829
  4. Grotschel, M., C. L. Monma, and M. Stoer, 'Design of survivable networks,' Network Models, M.O. Ball et al. (eds.), North-Holland, Amsterdam, 1995, 617-672
  5. Gusfield, D., 'Computing the strength of a graph,' SIAM Journal on Computing 20 (1991), 639-654 https://doi.org/10.1137/0220040
  6. Martel, C., G. Nuckolls, and D. Sniegowski, 'Computing the dis connectivity of a graph,' Working paper, DC Davis, 2001
  7. T. Wu, Fiber network survivability, Artech House, Boston, 1992