Highly Influenced

# An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane

@inproceedings{Garg1994AnOK, title={An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane}, author={Naveen Garg and Dorit S. Hochbaum}, booktitle={STOC}, year={1994} }

- Published 1994 in STOC
DOI:10.1145/195058.195218

A cable company is permitted to service k cities in a state with n cities. To minimise the cost of installation the company wishes to find a set of cities that are “close”. Since we need to connect these cities, a natural measure of “closeness” is the weight of the minimum tree spanning them where the weight of the edge (i, ~) is the euclidean dist ante, d(i, ~), between cities i and ~. More formally, the problem that we address in this paper is the following.

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 51 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**51**citations based on the available data.See our **FAQ** for additional information.

#### References

##### Publications referenced by this paper.

Showing 1-2 of 2 references

Highly Influential

Highly Influential