An Exact Algorithm for the Steiner Forest Problem
From MaRDI portal
Publication:5009640
DOI10.4230/LIPIcs.ESA.2018.70OpenAlexW2886653775MaRDI QIDQ5009640
Daniel R. Schmidt, Bernd Zey, Margot, François
Publication date: 4 August 2021
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9533/pdf/LIPIcs-ESA-2018-70.pdf/
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A factor 2 approximation algorithm for the generalized Steiner network problem
- The Steiner tree polytope and related polyhedra
- Tree polytope on 2-trees
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- The Steiner tree problem. II: Properties and classes of facets
- On implementing the push-relabel method for the maximum flow problem
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- Greedy Algorithms for Steiner Forest
- A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
- Fourier meets M\"{o}bius: fast subset convolution
- A new approach to the maximum-flow problem
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Reduction tests for the steiner problem in grapsh
- Solving the Steiner Tree Problem on a Graph Using Branch and Cut
- Solving Steiner tree problems in graphs to optimality
- Strong formulations for network design problems with connectivity requirements
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A General Approximation Technique for Constrained Forest Problems
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- A Local-Search Algorithm for Steiner Forest
- A catalog of steiner tree formulations
- Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
- The steiner problem in graphs
- A comparison of Steiner tree relaxations
