The Esau-Williams algorithm is one of the best known heuristics for the capacitated minimum spanning tree problem. This paper describes a simple enhancement of this heuristic. On benchmark test ...
Buletinul ştiinţific al Universitatii Baia Mare, Seria B, Fascicola matematică-informatică, Vol. 18, No. 1 (2002), pp. 95-104 (10 pages) We consider the Generalized Minimum Spanning Tree problem ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback