An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs

@article{Fischetti1993AnEA,
  title={An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs},
  author={Matteo Fischetti and Paolo Toth},
  journal={INFORMS Journal on Computing},
  year={1993},
  volume={5},
  pages={426-434}
}

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…