Reference health

On Steiner trees and minimum spanning trees in hypergraphs

https://doi.org/10.1016/s0167-6377(02)00185-2
CiteStamped reference-health badge
7/7 checkable references clean · checked 2026-07-21

Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.

6 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

The 7 checked references that resolve
resolves10.1002/net.3230100207
An integer linear programming approach to the steiner problem in graphs
resolves10.1002/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O
Solving Steiner tree problems in graphs to optimality
resolves10.1007/978-1-4613-0255-1_9
SteinLib: An Updated Library on Steiner Tree Problems in Graphs
resolves10.1016/S0166-218X(00)00318-8
A comparison of Steiner tree relaxations
resolves10.1016/S0166-218X(00)00319-X
Improved algorithms for the Steiner problem in networks
resolves10.18130/V3ZG4B
Spanning Trees in Hypergraphs with Applications to Steiner Trees
resolves10.1007/BF02612335
A dual ascent approach for steiner tree problems on a directed graph
The 6 references without a DOI — listed, not checked
no DOI — not checkedThe Steiner Tree Problem
no DOI — not checkedT.L. Magnanti, L.A. Wolsey, Optimal trees, in: M.O. Ball, et al. (Eds.), Handbooks in Operations Research and Management Science, Vol. 7, Elsevier Science, Amsterdam, 1995 (Chapter 9).
no DOI — not checkedT. Polzin, S. Vahdati Daneshmand, On Steiner trees and minimum spanning trees in hypergraphs, Research Report MPI-I-2001-1-005, Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany, 2001.
no DOI — not checkedT. Polzin, S. Vahdati Daneshmand, Using (sub)graphs of small width for solving the Steiner problem, Research Report MPI-I-2002-1-001, Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany, 2002.
no DOI — not checkedExact algorithms for plane Steiner tree problems: a computational study
no DOI — not checkedD.M. Warme, P. Winter, M. Zachariasen, GeoSteiner 3.1. http://www.diku.dk/geosteiner/, 2001.
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-07-21 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

view as graph · paper page

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.1016/s0167-6377(02)00185-2"><img src="https://citestamp.com/citestamped/10.1016/s0167-6377(02)00185-2/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1016/s0167-6377(02)00185-2/badge.svg)](https://citestamp.com/citestamped/10.1016/s0167-6377(02)00185-2)