Author:
Risso C.,Robledo F.,Nesmachnow S.
Reference39 articles.
1. Ahmed, R., Watkins, J., Wolff, A., Angelini, P., Darabi, F., Efrat, A., Glickenstein, D., Gronemann, M., Heinsohn, N., Kobourov, S., and Spence, R., Multi-level Steiner trees, J. Experim. Algorithmics, 2019, vol. 24, no. 1.
2. Aneja, Y., An integer linear programming approach to the Steiner problem in graphs, Networks, 1980, vol. 10, no. 2, pp. 167–178.
3. Angelopoulos, S., A near-tight bound for the online steiner tree problem in graphs of bounded asymmetry, in Proc. European Symp, on Algorithms, Berlin, Heidelberg: Springer, 2008, pp. 76–87.
4. The Oxford Handbook of Information and Communication Technologies, Avgerou, C., Mansell, R., Quah, D., and Silverstone, R., Eds., Oxford Univ. Press, 2009.
5. Beasley, J., An SST-based algorithm for the Steiner problem in graphs, Networks, 1989, vol. 19, no. 1, pp. 1–16.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献