Placing Green bridges optimally, with a multivariate analysis

DOI10.1007/978-3-030-80049-9_19MaRDI QIDQ2117784OpenAlexFDO

Authors Till Fluschnik, Leon Kellerhals

Publication date 22 March 2022

Full work available at URL https://arxiv.org/abs/2102.04539

zbMATH Keywords

computational complexitycomputational sustainabilityconnected subgraphsparameterized algorithmicswildlife crossings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

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
• Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
• Design of Survivable Networks: A survey
• On multiple steiner subgraph problems
• Parameterized algorithms
• Some simplified NP-complete graph problems
• Spanning Trees—Short or Small
• The 2-path network problem
• The Steiner forest problem revisited
• The complexity of designing a network with minimum diameter

Cited in

(2)

• Multivariate complexity analyses for algorithmic challenges in fairness and sustainability
• Placing green bridges optimally, with a multivariate analysis

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 Q2117784)