An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Naveen Garg, Dorit S. Hochbaum
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
STOC, 1994.

STOC 1994
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-1994-GargH,
	author        = "Naveen Garg and Dorit S. Hochbaum",
	booktitle     = "{Proceedings of the 26th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/195058.195218",
	isbn          = "0-89791-663-8",
	pages         = "432--438",
	publisher     = "{ACM}",
	title         = "{An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane}",
	year          = 1994,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.