Highly Influenced

# Minimum-weight spanning tree algorithms A survey and empirical study

@article{Bazlamaci2001MinimumweightST, title={Minimum-weight spanning tree algorithms A survey and empirical study}, author={C{\"u}neyt F. Bazlamaçci and Khalil S. Hindi}, journal={Computers & OR}, year={2001}, volume={28}, pages={767-785} }

- Published 2001 in Computers & OR
DOI:10.1016/S0305-0548(00)00007-1

The minimum-weight spanning tree problem is one of the most typical and well-known problems of combinatorial optimisation. E$cient solution techniques had been known for many years. However, in the last two decades asymptotically faster algorithms have been invented. Each new algorithm brought the time bound one step closer to linearity and "nally Karger, Klein and Tarjan proposed the only known expected linear-time method. Modern algorithms make use of more advanced data structures and appear… CONTINUE READING

Highly Cited

This paper has 61 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, results, connections, and topics extracted from this paper.

40 Extracted Citations

24 Extracted References

Similar Papers

#### Citing Papers

##### Publications influenced by this paper.

#### 61 Citations

Citations per Year

Semantic Scholar estimates that this publication has

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