Placing Green bridges optimally, with a multivariate analysis

DOI10.1007/978-3-030-80049-9_19OpenAlexW3178170134MaRDI QIDQ2117784

Leon Kellerhals, Till Fluschnik

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)

Cites Work

• The Steiner forest problem revisited
• Some simplified NP-complete graph problems
• A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem
• On multiple steiner subgraph problems
• The complexity of designing a network with minimum diameter
• The 2-path network problem
• Spanning Trees—Short or Small
• Design of Survivable Networks: A survey
• Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
• Parameterized Algorithms

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