Faster algorithms for Steiner tree and related problems: from theory to practice

DOI10.1007/978-3-031-24907-5_3MaRDI QIDQ6606515

Daniel Rehfeldt

Publication date: 17 September 2024

zbMATH Keywords

combinatorial optimizationexact methodsSteiner tree problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• The Steiner tree problem
• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
• The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
• Faster algorithm for optimum Steiner trees
• A dual ascent approach for steiner tree problems on a directed graph
• Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Solving Steiner tree problems in graphs to optimality
• Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem
• Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces
• On the Exact Solution of Prize-Collecting Steiner Tree Problems
• Fast Local Search for Steiner Trees in Graphs
• Steiner Tree Approximation via Iterative Randomized Rounding
• Matroids and integrality gaps for hypergraphic steiner tree relaxations
• The steiner problem in graphs
• Optimal connected subgraphs: Integer programming formulations and polyhedra
• Solving Steiner trees: Recent advances, challenges, and perspectives

This page was built for publication: Faster algorithms for Steiner tree and related problems: from theory to practice