Placing green bridges optimally, with a multivariate analysis
DOI10.1007/S00224-023-10157-5MaRDI QIDQ6635698FDOQ6635698
Authors: Till Fluschnik, Leon Kellerhals 
Publication date: 12 November 2024
Published in: Theory of Computing Systems (Search for Journal in Brave)
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
NP-hardnesscomputational sustainabilityconnected subgraphsparameterized algorithmicswildlife crossings
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) 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) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Efficiency of a Good But Not Linear Set Union Algorithm
- Parameterized algorithms
- Kernelization lower bounds through colors and IDs
- The 2-path network problem
- Spanning Trees—Short or Small
- The complexity of designing a network with minimum diameter
- Constructing scalable overlays for pub-sub with many topics
- Path-based supports for hypergraphs
- An optimization problem on graphs
- On complexity of subset interconnection designs
- Polynomial-time data reduction for the subset interconnection design problem
- Matroids and Subset Interconnection Design
- On multiple steiner subgraph problems
- Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
- The Steiner forest problem revisited
- Algorithms and Implementation for Interconnection Graph Problem
- A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem
- Connectivity inference in mass spectrometry based structure determination
- Complexity and algorithms for constant diameter augmentation problems
- Network construction with subgraph connectivity constraints
Cited In (2)
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)
