### Abstract

Original language | English |
---|---|

Publisher | Unknown Publisher |

Number of pages | 36 |

Volume | 1994-106 |

Publication status | Published - 1994 |

### Publication series

Name | CentER Discussion Paper |
---|---|

Volume | 1994-106 |

### Fingerprint

### Keywords

- Networks
- Cost Allocation
- costs and cost price

### Cite this

*On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems*. (CentER Discussion Paper; Vol. 1994-106). Unknown Publisher.

}

**On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems.** / Feltkamp, V.; Tijs, S.H.; Muto, S.

Research output: Working paper › Discussion paper › Other research output

TY - UNPB

T1 - On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems

AU - Feltkamp, V.

AU - Tijs, S.H.

AU - Muto, S.

N1 - Pagination: 36

PY - 1994

Y1 - 1994

N2 - Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems in which an existing network has to be extended to connect users to a source. This paper generalizes the definition of irreducible core to minimum cost spanning extension problems and introduces an algorithm generating all elements of the irreducible core. Moreover, the equal remaining obligations rule, a one-point refinement of the irreducible core ispresented. Finally, the paper characterizes these solutions axiomatically. The classical Bird tree allocation of minimum cost spanning tree problems is obtained as a particular case in our algorithm for the irreducible core.

AB - Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems in which an existing network has to be extended to connect users to a source. This paper generalizes the definition of irreducible core to minimum cost spanning extension problems and introduces an algorithm generating all elements of the irreducible core. Moreover, the equal remaining obligations rule, a one-point refinement of the irreducible core ispresented. Finally, the paper characterizes these solutions axiomatically. The classical Bird tree allocation of minimum cost spanning tree problems is obtained as a particular case in our algorithm for the irreducible core.

KW - Networks

KW - Cost Allocation

KW - costs and cost price

M3 - Discussion paper

VL - 1994-106

T3 - CentER Discussion Paper

BT - On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems

PB - Unknown Publisher

ER -