G. Bergantiños Cid, M. Gómez-Rua, N. Llorca-Pascual, M. Pulido Cayuela, J. Sánchez Soriano

In this paper we consider k-hop minimum cost spanning tree problems where each node needs to be connected to the source through a path involving at most k links. We prove that the core of a k-hop minimum cost spanning tree problem could be empty. We also introduce and characterize a cost sharing rule based on bankruptcy problems which satisfies meaningful properties in this setting.

Palabras clave: k-hop minimum cost spanning tree problems bankruptcy problems cea

F. Llerena, M. Núñez Oliva

A. Meca Martínez, G. Sosic

G. Bergantiños Cid, L. Lorenzo Picado, S. Lorenzo Freire, J. J. Vidal Puga