Skip to main content
SpringerLink
Log in
Book cover

Operational Research pp 67–83Cite as

Computational Comparison of Algorithms for a Generalization of the Node-Weighted Steiner Tree and Forest Problems

  • Conference paper

  • 794 Accesses

Part of the book series: CIM Series in Mathematical Sciences ((CIMSMS,volume 4))

Abstract

Habitat fragmentation is a serious threat for the sustainability of species. Thus, the identification of effective linkages to connect valuable ecological units is an important issue in conservation biology. The design of effective linkages should take into account that areas which are adequately permeable for some species’ dispersal may act as obstructions for other species. The determination of minimum cost effective linkages is a generalization of both node-weighted Steiner tree and node-weighted Steiner forest problems. We compare the performance of different procedures for this problem using large real and simulated instances.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Alagador, D., Triviño, M., Cerdeira, J.O., Brás, R., Cabeza, M., Araújo, M.B.: Linking like with like: optimizing connectivity between environmentally-similar habitats. Landsc. Ecol. 27(2), 291–301 (2012)

    Article  Google Scholar 

  2. Brás, R., Cerdeira, J.O., Alagador, D., Araújo, M.B.: Multylink, version 2.0.2 (2012). (computer software http://purl.oclc.org/multylink)

  3. Brás, R., Cerdeira, J.O., Alagador, D., Araújo, M.B.: Linking habitats for multiple species. Env. Model. Softw. 40, 336–339 (2013)

    Article  Google Scholar 

  4. Brooks, T.M., Mittermeier, R.A., Mittermeier, C.G., Rylands, A.B., da Fonseca, G.A.B., Konstant, W.R., Flick, P., Pilgrim, J., Oldfield, S., Magin, G., Hilton-Taylor, C.: Habitat loss and extinction in the hotspots of biodiversity. Conserv. Biol. 16, 909–923 (2002)

    Article  Google Scholar 

  5. Demaine, E., Hajiaghayi, M., Klein, P.: Node-weighted steiner tree and group steiner tree in planar graphs. In: Albers, S., et al. (eds.) Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 5555, pp. 328–340. Springer, Berlin/Heidelberg (2009)

    Chapter  Google Scholar 

  6. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195–207 (1971)

    Article  MathSciNet  Google Scholar 

  8. Duin, C.W., Volgenant, A.: Some generalizations of the Steiner problem in graphs. Networks 17(3), 353–364 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  9. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6(2), 109–133 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  10. Hanski, I.: The Shrinking World: Ecological Consequences of Habitat Loss. Excellence in Ecology, vol. 14. International Ecology Institute, Oldendorf/Luhe (2005)

    Google Scholar 

  11. Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms 19(1), 104–115 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Inf. 15, 141–145 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  13. Lai, K.J., Gomes, C.P., Schwartz, M.K., McKelvey, K.S., Calkin, D.E., Montgomery, C.A.: The Steiner multigraph problem: wildlife corridor design for multiple species. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, vol. 2, pp. 1357–1364 (2011)

    Google Scholar 

  14. Magnanti, T.L., Raghavan, S.: Strong formulations for network design problems with connectivity requirements. Networks 45(2), 61–79 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  15. Merriam, G.: Connectivity: a fundamental ecological characteristic of landscape pattern. In: Brandt, J., Agger, P. (eds.) Proceedings of the 1st International Seminar on Methodology in Landscape Ecological Research and Planning, pp. 5–15. Roskilde University, Denmark (1984)

    Google Scholar 

  16. Rayward-Smith, V.J.: The computation of nearly minimal Steiner trees in graphs. Int. J. Math. Educ. Sci. Technol. 14(1), 15–23 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  17. Rayward-Smith, V.J., Clare, A.: On finding Steiner vertices. Networks 16(3), 283–294 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  18. Segev, A.: The node-weighted steiner tree problem. Networks 17, 1–17 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  19. Siek, J.G., Lee, L., Lumsdaine, A.: The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley Longman, Boston (2002)

    Google Scholar 

  20. Winter, P.: Steiner problem in networks: a survey. Networks 17, 129–167 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  21. Wong, R.: A dual ascent approach for Steiner tree problems on a directed graph. Math. Progr. 28, 271–287 (1984)

    Article  MATH  Google Scholar 

Download references

Acknowledgements

We are grateful to Maria João Martins and Diogo Alagador for discussion and assistance. Both authors were supported by the Portuguese Foundation for Science and Technology (FCT). R. Brás was funded by the project PEst-OE/EGE/UI0491/2013 and the CEMAPRE (Centro de Matemática Aplicada à Previsão e Decisão Económica) under the FEDER/POCI Programme. J. O. Cerdeira was funded through the projects UID/MAT/00297/2013, CMA (Centro de Matemática e Aplicações) and PTDC/AAC-AMB/113394/2009.

Author information

Authors and Affiliations

  1. Instituto Superior de Economia e Gestão and Centro de Matemática Aplicada à Previsão e Decisão Económica, Universidade de Lisboa, Lisboa, Portugal

    Raul Brás

  2. Departamento de Matemática & Centro de Matemática e Aplicações, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, Lisboa, Portugal

    J. Orestes Cerdeira

Authors
  1. Raul Brás
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Orestes Cerdeira
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Raul Brás .

Editor information

Editors and Affiliations

  1. Department of Mathematics and LIAAD-INESC TEC, Polytechnic Institute of Bragança; School of Technology and Management, Bragança, Portugal

    João Paulo Almeida

  2. Faculty of Engineering, CEGI - INESC TEC; University of Porto, Porto, Portugal

    José Fernando Oliveira

  3. Department of Mathematics and LIAAD-INESC TEC, University of Porto, Porto, Portugal

    Alberto Adrego Pinto

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Brás, R., Cerdeira, J.O. (2015). Computational Comparison of Algorithms for a Generalization of the Node-Weighted Steiner Tree and Forest Problems. In: Almeida, J., Oliveira, J., Pinto, A. (eds) Operational Research. CIM Series in Mathematical Sciences, vol 4. Springer, Cham. https://doi.org/10.1007/978-3-319-20328-7_5

Download citation

Publish with us

Policies and ethics

Search

Navigation