Reference health

A Vertex Oriented Approach to Minimum Cost Spanning Tree Problems

https://doi.org/10.2139/ssrn.1047541
CiteStamped reference-health badge
1 of 14 checkable references need attention · checked 2026-07-24

At the dated check, the references listed below either did not resolve in Crossref or DataCite, or carried a retraction notice. Each one is shown with the registry record that put it there.

4 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.

References needing attention

does not resolve to a known work10.2307/2033241
The 13 checked references that resolve
resolves10.1007/s00182-006-0069-7
The optimistic TU game in minimum cost spanning tree problems
resolves10.1002/net.3230060404
On cost allocation for a spanning tree: A game theoretic approach
resolves10.1007/s11238-004-5635-5
The P-value for cost sharing in minimum
resolves10.1002/net.3230030402
Cost allocation for a spanning tree
resolves10.1016/j.geb.2003.09.008
Cost monotonicity, consistency and minimum cost spanning tree games
resolves10.1109/mahc.1985.10011
On the History of the Minimum Spanning Tree Problem
resolves10.1007/bf01584227
Minimum cost spanning tree games
resolves10.1007/bf02592000
On the core and nucleolus of minimum cost spanning tree games
resolves10.1006/game.2001.0883
Axiomatization of the Shapley Value on Minimum Cost Spanning Tree Games
resolves10.2139/ssrn.814646
Cost Monotonic 'Construct and Charge' Rules for Connection Situations
resolves10.1016/s0377-2217(02)00714-2
Minimum cost spanning tree games and population monotonic allocation schemes
resolves10.1002/j.1538-7305.1957.tb01515.x
Shortest Connection Networks And Some Generalizations
resolves10.1016/j.ejor.2005.04.036
Obligation rules for minimum cost spanning tree situations and their monotonicity properties
The 4 references without a DOI — listed, not checked
no DOI — not checkedref1
no DOI — not checkedref7
no DOI — not checkedref8
no DOI — not checkedref9
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-24 — 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.2139/ssrn.1047541"><img src="https://citestamp.com/citestamped/10.2139/ssrn.1047541/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.2139/ssrn.1047541/badge.svg)](https://citestamp.com/citestamped/10.2139/ssrn.1047541)