Garg, N. (1996) A 3-approximation algorithm for the minimum tree spanning k vertices In: FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science, October 14-16, 1996, Burlington, VT, USA.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/548489/?reload...
Abstract
In this paper we give a 3-approximation algorithm for the problem of finding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximation algorithm for the minimum tour that visits any k-vertices.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 101329 |
| Deposited On: | 31 Jan 2018 09:34 |
| Last Modified: | 31 Jan 2018 09:34 |
Repository Staff Only: item control page
