Placing Green Bridges Optimally, with a Multivariate Analysis

TL;DR

This paper addresses the optimal placement of green bridges to connect wildlife habitats over obstacles, using computational models and analysis to improve conservation planning.

Contribution

It introduces new problem models for green bridge placement and analyzes their computational complexity and parameterized algorithms.

Findings

Identified the computational complexity of placement problems.

Developed parameterized algorithms for efficient solutions.

Provided insights into cost-effective habitat connectivity strategies.

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 different problem models for this task and study them from a computational complexity and parameterized algorithmics perspective.