Kaymakov, Kirill V.; Malyshev, Dmitry S. On efficient algorithms for bottleneck path problems with many sources. (English) Zbl 07852031 Optim. Lett. 18, No. 5, 1273-1283 (2024). MSC: 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
Lichen, Junran; Li, Jianping; Lih, Ko-Wei Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length. (English) Zbl 1386.90162 Optim. Lett. 11, No. 8, 1663-1675 (2017). MSC: 90C35 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Silva, Ricardo M. A.; Silva, Diego M.; Resende, Mauricio G. C.; Mateus, Geraldo R.; Gonçalves, José F.; Festa, Paola An edge-swap heuristic for generating spanning trees with minimum number of branch vertices. (English) Zbl 1292.90305 Optim. Lett. 8, No. 4, 1225-1243 (2014). MSC: 90C35 90C59 × Cite Format Result Cite Review PDF Full Text: DOI Link