Algorithm Engineering and Experiments
Author | : David M. Mount |
Publisher | : Springer Science & Business Media |
Total Pages | : 215 |
Release | : 2002-07-24 |
Genre | : Architecture |
ISBN | : 3540439773 |
Download Algorithm Engineering and Experiments Book in PDF, Epub and Kindle
poggi@inf. puc-rio. br,rwerneck@cs. princeton. edu Abstract. Someofthemostwidelyusedconstructiveheuristicsforthe Steiner Problem in Graphs are based on algorithms for the Minimum Spanning Tree problem. In this paper, we examine e?cient implem- tations of heuristics based on the classic algorithms by Prim, Kruskal, and Bor? uvka.