Optimizing the ecological connectivity of landscapes with generalized flow models and preprocessing

09/14/2021
by   François Hamonic, et al.
0

In this paper we consider the problem of optimizing the ecological connectivity of a landscape under a budget constraint by improving habitat areas and ecological corridors between them. We consider a formulation of this problem in terms of graphs in which vertices represent the habitat areas and arcs represent a probability of connection between two areas that depend on the quality of the respective corridor. We propose a new generalized flow model that improves existing models for this problem and an efficient preprocessing algorithm that reduces the size of the graphs on which generalized flows is computed. Reported numerical experiments highlight the benefice of these two contributions on computation times and show that larger problems can be solved using them. Our experiments also show that several variants of greedy algorithms perform relatively well on practical instances while they return arbitrary bad solutions in the worst case.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/14/2018

An Experimental Study of Algorithms for Online Bipartite Matching

We perform an experimental study of algorithms for online bipartite matc...
research
01/31/2022

Max Flow Vitality of Edges and Vertices in Undirected Planar Graphs

We study the problem of computing the vitality with respect to max flow ...
research
08/24/2019

Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing

Flow routing over inter-datacenter networks is a well-known problem wher...
research
11/10/2017

Group Connectivity: Z_4 v. Z_2^2

We answer a question on group connectivity suggested by Jaeger et al. [G...
research
08/22/2022

Locally Defined Independence Systems on Graphs

The maximization for the independence systems defined on graphs is a gen...
research
06/12/2014

Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning

We present a first theoretical analysis of the power of polynomial-time ...

Please sign up or login with your details

Forgot password? Click here to reset