Skip to Main Content
The Steiner Multigraph Problem: Wildlife corridor design for multiple speciesAuthor(s): Katherine J. Lai; Carla P. Gomes; Michael K. Schwartz; Kevin S. McKelvey; David E. Calkin; Claire A. Montgomery
Source: In: Burgard, W.; Roth, D., eds. Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI-11); San Francisco, CA, USA; August 7-11, 2011. AAAI Press. 8 p.
Publication Series: Paper (invited, offered, keynote)
Station: Rocky Mountain Research Station
PDF: View PDF (481.83 KB)
DescriptionThe conservation of wildlife corridors between existing habitat preserves is important for combating the effects of habitat loss and fragmentation facing species of concern. We introduce the Steiner Multigraph Problem to model the problem of minimum-cost wildlife corridor design for multiple species with different landscape requirements. This problem can also model other analogous settings in wireless and social networks. As a generalization of Steiner forest, the goal is to find a minimum-cost subgraph that connects multiple sets of terminals. In contrast to Steiner forest, each set of terminals can only be connected via a subset of the nodes. Generalizing Steiner forest in this way makes the problem NP-hard even when restricted to two pairs of terminals. However, we show that if the node subsets have a nested structure, the problem admits a fixed-parameter tractable algorithm in the number of terminals.We successfully test exact and heuristic solution approaches on a wildlife corridor instance for wolverines and lynx in western Montana, showing that though the problem is computationally hard, heuristics perform well, and provably optimal solutions can still be obtained.
- You may send email to firstname.lastname@example.org to request a hard copy of this publication.
- (Please specify exactly which publication you are requesting and your mailing address.)
- We recommend that you also print this page and attach it to the printout of the article, to retain the full citation information.
- This article was written and prepared by U.S. Government employees on official time, and is therefore in the public domain.
CitationLai, Katherine J.; Gomes, Carla P.; Schwartz, Michael K.; McKelvey, Kevin S.; Calkin, David E.; Montgomery, Claire A. 2011. The Steiner Multigraph Problem: Wildlife corridor design for multiple species. In: Burgard, W.; Roth, D., eds. Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI-11); San Francisco, CA, USA; August 7-11, 2011. AAAI Press. 8 p.
Keywordscomputational sustainability, wildlife corridors, constraint optimization, Steiner forest
- Robust network design for multispecies conservation
- Combining resource selection and movement behavior to predict corridors for Canada lynx at their southern range periphery
- Large landscape conservation-synthetic and real-world datasets
XML: View XML