Author:
Silva Ricardo M. A.,Silva Diego M.,Resende Mauricio G. C.,Mateus Geraldo R.,Gonçalves José F.,Festa Paola
Publisher
Springer Science and Business Media LLC
Reference15 articles.
1. Beasley, J.E.: An SST-based algorithm for the Steiner problem in graphs. Networks 19, 1–16 (1989)
2. Carrabs, F., Cerulli, R., Gaudioso, M., Gentili, M.: Lower and upper bounds for the spanning tree with minimum branch vertices. Technical Report 3, Department of Mathematics and Computer Science, University of Salerno. Salerno, Italy (2009)
3. Cerulli, R.: Personal, communication. January (2010)
4. Cerulli, R., Gentili, M., Iossa, A.: Bounded-degree spanning tree problems: models and new algorithms. Comput. Optim. Appl. 42, 353–370 (2009)
5. Cherkassky, B.V., Goldberg, A.V.: Negative-cycle detection algorithms. Technical Report 96–029NEC Research Institute, Inc., Princeton, NJ (1996)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献