Placing green bridges optimally, with a multivariate analysis

2025/03/15 by Fluschnik, Till, Kellerhals, Leon
#500 Naturwissenschaften und Mathematik::510 Mathematik::510 Mathematik #NP-hardness #computational sustainability #connected subgraphs #parameterized algorithmics #wildlife crossings

paper · doi:10.14279/depositonce-22626

Abstract

We study the problem of placing wildlife crossings, such as green bridges, over human-made obstacles to challenge habitat fragmentation. The main task herein is, given a graph describing habitats or routes of wildlife animals and possibilities of building green bridges, to find a low-cost placement of green bridges that connects the habitats. We develop three problem models for this task and study them from a computational complexity and parameterized algorithmics perspective.

Related

• Placing Green Bridges Optimally, with Habitats Inducing Cycles
• Placing Green Bridges Optimally, with Close-Range Habitats in Sparse Graphs
• A graph theoretic approach for modelling wildlife corridors
• Optimizing the ecological connectivity of landscapes with generalized\n flow models and preprocessing
• Predicting species assemblages at wildlife crossing structures using multivariate regression of principal coordinates