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}
}
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
40 Extracted Citations
24 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 40 extracted citations

61 Citations

05'05'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 24 references

Data structures and network algorithms

  • RE Tarjan
  • In CBMS-NFS Regional Conference Series in Applied…
  • 1983
Highly Influential
4 Excerpts

Shortest connection networks and some generalizations

  • RC Prim
  • Bell System Technical Journal
  • 1957
Highly Influential
12 Excerpts

On the shortest spanning subtree of a graph and the traveling salesman problem

  • JB Kruskal
  • Proceedings of the American Mathematical Society
  • 1956
Highly Influential
10 Excerpts

Bibliography on algorithms for shortest path, shortest spanning tree and related circuit routing problems (1956}1974). Networks 1975;5:129}49

  • AR Pierce
  • C.F. Bazlamac7 cn, K.S. Hindi / Computers…
  • 2001
1 Excerpt

Optimised network design: minimum spanning trees and minimum concave-cost problems

  • CF cm
  • Ph.D. thesis,
  • 1996
2 Excerpts

Similar Papers

Loading similar papers…