Searching for "An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

An O(log k)-approximation algorithm for the k minimum spanning tree problem in the plane
by Naveen Garg, Dorit S. Hochbaum — 1994 — In Proceedings of the 26th Annual ACM Symposium on Theory of Computing
…An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane Naveen…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB