Folk solution for simple minimum cost spanning tree problems

  • Referencia: Subiza, B., Giménez-Gómez, J.M. y Peris, J.E.: “Folk solution for simple minimum cost spanning tree problems”. 2016, Operations Research Letters 44, 598-601. DOI:

A minimum cost spanning tree problem analyzes how to efficiently connect a group of individuals to a source. Once the efficient tree is obtained, the addressed question is how to allocate the total cost among the involved agents. One prominent solution in allocating this minimum cost is the so-called Folk solution. Unfortunately, in general, the Folk solution is not easy to compute. We identify a class of mcst problems in which the Folk solution is obtained in an easy way. This class includes elementary cost mcst problems.

Deja una respuesta

Tu dirección de correo no se publicará. Los campos obligatorios están marcados con *

Puedes usar las siguientes etiquetas y atributos HTML: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>

borrarEnviar comentario