Arrow Research search
Back to STOC

STOC 1995

A constant-factor approximation for the k -MST problem in the plane

Conference Paper Accepted Paper Algorithms and Complexity ยท Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
1098420424317374317