Skip to content
cs-conference-ranking.org

Saving an epsilon: a 2-approximation for the k-MST problem in graphs.

Naveen Garg

VenueA*STOC
Year2005
ProceedingsSTOC
DBLP recordconf/stoc/Garg05 ↗

Browse the full STOC paper archive.