scientific article; zbMATH DE number 1947441
From MaRDI portal
Publication:4411411
zbMath1019.68613MaRDI QIDQ4411411
Siavash Vahdati Daneshmand, Tobias Polzin
Publication date: 8 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610795.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
The Influence of Preprocessing on Steiner Tree Approximations ⋮ On the Exact Solution of Prize-Collecting Steiner Tree Problems ⋮ A linear programming based approach to the Steiner tree problem with a fixed number of terminals ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm ⋮ SCIP-Jack -- a solver for STP and variants with parallelization extensions ⋮ Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem ⋮ Strong Steiner Tree Approximations in Practice ⋮ Reduction tests for the prize-collecting Steiner problem ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Approaches to the Steiner Problem in Networks ⋮ On Steiner trees and minimum spanning trees in hypergraphs
This page was built for publication:
