Exploring the constrained maximum edge-weight connected graph problem

  • Zhen-ping Li
  • Shi-hua Zhang
  • Xiang-Sun ZhangEmail author
  • Luo-nan Chen


Given an edge weighted graph, the maximum edge-weight connected graph (MECG) is a connected subgraph with a given number of edges and the maximal weight sum. Here we study a special case, i.e. the Constrained Maximum Edge-Weight Connected Graph problem (CMECG), which is an MECG whose candidate subgraphs must include a given set of k edges, then also called the k-CMECG. We formulate the k-CMECG into an integer linear programming model based on the network flow problem. The k-CMECG is proved to be NP-hard. For the special case 1-CMECG, we propose an exact algorithm and a heuristic algorithm respectively. We also propose a heuristic algorithm for the k-CMECG problem. Some simulations have been done to analyze the quality of these algorithms. Moreover, we show that the algorithm for 1-CMECG problem can lead to the solution of the general MECG problem.


connected subgraph integer linear programming model network flow constraint Steiner network maximum edge weight heuristic algorithm 

2000 MR Subject Classification

90-08 90B10 94C15 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Balakrishnan, A., Altinkemer, K. Using a hop-constrained model to generate alternative communication network design. ORSA Journal on Computing, 4: 192–205 (1992)zbMATHGoogle Scholar
  2. [2]
    Balas, E. An Additive Algorithm for Solving Linear Programs with Zero-One Variables. Operations Research, 13: 517–548 (1965)CrossRefMathSciNetGoogle Scholar
  3. [3]
    Canuto, S.A., Resende, M.G.C., Ribeiro, C.C. Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks, 38: 50–58 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    Cheng, X., Li, Y., Du, D., Ngo, H.Q. Steiner Trees in Industry. Handbook of Combinatorial Optimization, 193–216 (2005)Google Scholar
  5. [5]
    Costa, A.M., Cordeau, J.-F., Laporte, G. Steiner tree problems with profits. INFOR, 44: 99–115 (2006)MathSciNetGoogle Scholar
  6. [6]
    Du, D.Z, Hwang, F.K., Xue, G. Interconnecting highways. SIAM Discrete Mathematics, 12: 252–261 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    Guo, Z. et al. Edge-based scoring and searching method for identifying condition-responsive protein-protein interaction sub-network. Bioinformatics, 23: 2121–2128 (2007)CrossRefGoogle Scholar
  8. [8]
    Ideker, T. et al. Discovering regulatory and signalling circuits in molecular interaction networks. Bioinformatics, 18(Suppl. 1): S233–240 (2002)Google Scholar
  9. [9]
    Lee, H.F., Dooly, D.R. Algorithm for the constrainted maximum-weight connected graph problem. Naval Research Logistics, 43: 985–1008 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    Newman, M.E.J. The structure and function of complex networks. SIAM Rev, 45: 167–256 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    Zhang, S., Jin, G., Zhang, X.S., Chen, L. Discovering functions and revealing mechanisms at molecular level from biological networks. Proteomics, 7(16): 2856–2869 (2007)CrossRefGoogle Scholar
  12. [12]
    Hwang, F.K., Richards, D.S., Winter, P. The Steiner Tree Problem, North-Holland, Amsterdan, 1992zbMATHGoogle Scholar
  13. [13]
    Costa, A.M., Cordeau, J.-F., Laporte, G. Models and branch-and-cut algorithms for the Steiner tree problem with revenus, budget and hop constraints. Technical Report CRT-2006-14, Center for Research on Transportation, Montreal, 2006Google Scholar

Copyright information

© Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences and Springer Berlin Heidelberg 2009

Authors and Affiliations

  • Zhen-ping Li
    • 1
  • Shi-hua Zhang
    • 2
  • Xiang-Sun Zhang
    • 2
    Email author
  • Luo-nan Chen
    • 3
    • 4
  1. 1.School of InformationBeijing Wuzi UniversityBeijingChina
  2. 2.Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijingChina
  3. 3.Institute of Systems BiologyShanghai UniversityShanghaiChina
  4. 4.Department of Electrical Engineering and ElectronicsOsaka Sangyo UniversityOsakaJapan

Personalised recommendations