Cost allocation for a spanning tree

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1973 English Publisher:WileyJournal:Networks, volume 3, pages 289-304 (issn: 0028-3045, eissn: 1097-0037,

Copyright policy )

Authors: Armin Claus; Daniel J. Kleitman;

doi: 10.1002/net.3230030402

Cost allocation for a spanning tree

- Summary
- Subjects
- Metrics

Abstract

AbstractThe problem of allocating cost in a spanning tree network is considered. A number of possible schemes are surveyed, and critically analyzed. Methods are suggested that are preferred given different emphases among the criteria for such a function.

Related Organizations

Tufts University
United States
Massachusetts Institute of Technology
United States

Keywords

Extremal problems in graph theory, Deterministic network models in operations research

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	104
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average