Author:
Singh Kavita,Sundar Shyam
Publisher
Springer Science and Business Media LLC
Reference21 articles.
1. Arkin E, Halldorssom M, Hassin R (1993) Approximating the tree and tour covers of a graph. Inf Process Lett 47:275–282
2. Chaurasia SN, Singh A (2016) A hybrid heuristic for dominating tree problem. Soft Comput Springer 20:1–21
3. Drazic Z, Cangalovic M, Kovacevic-Vujcic V (2017) A metaheuristic approach to the dominating tree problem. Optim Lett Springer 11:1155–1167
4. Fujito T (2001) On approximability of the independent/connected edge dominating set problems. Inf Process Lett 79:261–266
5. Fujito T (2006) How to trim an MST: A 2-approximation algorithm for minimum cost tree cover. In: Proceedings of the 33rd international colloquium on automata, languages and programming, ICALP, Part I. Venice, July 10-14, 2006, pp 431–442
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献