
AbstractA set of points, called consumers, and another point called central supplier, are located in a Euclidean plane. The cost of constructing a connection between two points is proportional to the distance between them. The minimum cost required for connecting all the consumers to the supplier is given by a minimal Steiner tree. An example is given in which for every allocation of the total cost of the tree to the consumers, a coalition of consumers exists, which is charged more than the cost required for connecting its members to the central supplier.
Extremal problems in graph theory, Other game-theoretic models, Switching theory, application of Boolean algebra; Boolean functions, Programming involving graphs or networks, Operations research and management science
Extremal problems in graph theory, Other game-theoretic models, Switching theory, application of Boolean algebra; Boolean functions, Programming involving graphs or networks, Operations research and management science
| 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). | 63 | |
| 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 |
