Placing green bridges optimally, with a multivariate analysis

DOI10.1007/s00224-023-10157-5MaRDI QIDQ6635698

Till Fluschnik, Leon Kellerhals

Publication date: 12 November 2024

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

zbMATH Keywords

NP-hardnesscomputational sustainabilityconnected subgraphsparameterized algorithmicswildlife crossings

Mathematics Subject Classification ID

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

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