Placing green bridges optimally, with a multivariate analysis

DOI10.1007/S00224-023-10157-5MaRDI QIDQ6635698zbMATH OpenFDO

Authors Till Fluschnik, Leon Kellerhals

Publication date 12 November 2024

Published in Theory of Computing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00224-023-10157-5

zbMATH Keywords

computational sustainabilityconnected subgraphsNP-hardnessparameterized algorithmicswildlife crossings

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35) Ecology (92D40)

Recommendations

• Placing Green bridges optimally, with a multivariate analysis
• Wildlife corridors as a connected subgraph problem
• Optimizing the ecological connectivity of landscapes
• Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach
• Multivariate complexity analyses for algorithmic challenges in fairness and sustainability

Cites work

• A 2-approximation algorithm and beyond for the minimum diameter k-Steiner forest problem
• Algorithms and Implementation for Interconnection Graph Problem
• An optimization problem on graphs
• Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
• Complexity and algorithms for constant diameter augmentation problems
• Connectivity inference in mass spectrometry based structure determination
• Constructing scalable overlays for pub-sub with many topics
• Efficiency of a Good But Not Linear Set Union Algorithm
• Kernelization lower bounds through colors and IDs
• Matroids and Subset Interconnection Design
• Network construction with subgraph connectivity constraints
• On complexity of subset interconnection designs
• On multiple steiner subgraph problems
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Parameterized algorithms
• Path-based supports for hypergraphs
• Polynomial-time data reduction for the subset interconnection design problem
• Spanning Trees—Short or Small
• The 2-path network problem
• The complexity of designing a network with minimum diameter
• The Steiner forest problem revisited

Cited in

(3)

• Placing Green bridges optimally, with a multivariate analysis
• Optimizing the ecological connectivity of landscapes
• Multivariate complexity analyses for algorithmic challenges in fairness and sustainability

This page was built for publication: Placing green bridges optimally, with a multivariate analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635698)