Abstract

Given a connected node-weighted (di)graph, with a root node r, and a (possibly empty) set of nodes R, the Rooted Maximum Node-Weight Connected Subgraph Problem (RMWCS) is the problem of finding a connected subgraph rooted at r that connects all nodes in R with maximum total weight. In this paper we consider the RMWCS as well as its budget-constrained version, in which also non-negative costs of the nodes are given, and the solution is not allowed to exceed a given budget. The considered problems belong to the class of network design problems and have applications in various different areas such as wildlife preservation planning, forestry, system biology and computer vision.

We present three new integer linear programming formulations for the problem and its variant which are based on node variables only. These new models rely on a different representation of connectivity than the one previously presented in the RMWCS literature that rely on a transformation into the Steiner Arborescence problem. We theoretically compare the strength of the proposed and the existing formulations, and show that one of our models preserves the tight LP bounds of the previously proposed cut set model of Dilkina and Gomes. Moreover, we study the rooted connected subgraph polytope in the natural space of node variables. We conduct a computational study and (empirically) compare the theoretically strongest one of our formulations with the one previously proposed using ad-hoc branch-and-cut implementations.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Backes, C., Rurainski, A., Klau, G., Müller, O., Stöckel, D., Gerasch, A., Küntzer, J., Maisel, D., Ludwig, N., Hein, M., Keller, A., Burtscher, H., Kaufmann, M., Meese, E., Lenhof, H.: An integer linear programming approach for finding deregulated subgraphs in regulatory networks. Nucleic Acids Research 1, 1–13 (2011)Google Scholar
  2. 2.
    Carvajal, R., Constantino, M., Goycoolea, M., Vielma, J.P., Weintraub, A.: Imposing connectivity constraints in forest planning models (2011) (submitted)Google Scholar
  3. 3.
    Chen, S., Ljubić, I., Raghavan, S.: The generalized regenerator location problem (2012) (submitted) Google Scholar
  4. 4.
    Conrad, J.M., Gomes, C.P., van Hoeve, W.-J., Sabharwal, A., Suter, J.F.: Wildlife corridors as a connected subgraph problem. Journal of Environmental Economics and Management 63(1), 1–18 (2012)MATHCrossRefGoogle Scholar
  5. 5.
    Dilkina, B., Gomes, C.: Solving connected subgraph problems in wildlife conservation. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 102–116. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. 6.
    Dilkina, B., Gomes, C.: Synthetic corridor problem generator (2012), http://www.cs.cornell.edu/~bistra/connectedsubgraph.htm
  7. 7.
    Dittrich, M., Klau, G., Rosenwald, A., Dandekar, T., Müller, T.: Identifying functional modules in protein-protein interaction networks: an integrated exact approach. Bioinformatics 24, i223–i231 (2008)CrossRefGoogle Scholar
  8. 8.
    Fügenschuh, A., Fügenschuh, M.: Integer linear programming models for topology optimization in sheet metal design. Mathematical Methods of Operations Research 68(2), 313–331 (2008)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Johnson, D.S., Minkoff, M., Phillips, S.: The prize-collecting Steiner tree problem: Theory and practice. In: Proc. 11th ACM-SIAM Symp. Discrete Algorithms, SODA 2000, San Francisco, USA, January 9-11, pp. 760–769 (2000)Google Scholar
  10. 10.
    Kaparis, K., Letchford, A.N.: Separation algorithms for 0-1 knapsack polytopes. Mathematical Programming 124(1-2), 69–91 (2010)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks 32, 207–232 (1998)MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Lee, H., Dooly, D.: Decomposition algorithms for the maximum-weight connected graph problem. Naval Research Logistics 45, 817–837 (1998)MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Ljubić, I.: Exact and Memetic Algorithms for Two Network Design Problems. PhD thesis, Vienna University of Technology (2004)Google Scholar
  14. 14.
    Ljubić, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., Fischetti, M.: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Programming, Series B 105, 427–449 (2006)MATHCrossRefGoogle Scholar
  15. 15.
    Moss, A., Rabani, Y.: Approximation algorithms for constrained node weighted Steiner tree problems. SIAM J. Comput. 37(2), 460–481 (2007)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Eduardo Álvarez-Miranda
    • 1
  • Ivana Ljubić
    • 2
  • Petra Mutzel
    • 3
  1. 1.Dipartimento di Elettronica, Informatica e SistemisticaUniversity of BolognaItaly
  2. 2.Department of Statistics and Operations ResearchUniversity of ViennaViennaAustria
  3. 3.Faculty of Computer ScienceTU DortmundDortmundGermany

Personalised recommendations