scientific article
From MaRDI portal
Publication:2753742
zbMath0976.90083MaRDI QIDQ2753742
Siavash Vahdati Daneshmand, Tobias Polzin
Publication date: 6 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (5)
New primal-dual algorithms for Steiner tree problems ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Decomposition methods for the two-stage stochastic Steiner tree problem ⋮ A partition-based relaxation for Steiner trees ⋮ Approaches to the Steiner Problem in Networks
Uses Software
This page was built for publication:
