Some results on greedy algorithm conjectures

0.00 Avg rating—0 Votes

Article ID:	iaor19951099
Country:	Netherlands
Volume:	52
Issue:	2
Start Page Number:	169
End Page Number:	194
Publication Date:	Aug 1994
Journal:	Discrete Applied Mathematics
Authors:	Cole T.
Keywords:	Steiner problem

Abstract:

The case n=4 is proved for two different performance conjectures relating minimal Steiner networks and algorithmically generated greedy networks.

Reviews

Required fields are marked *. Your email address will not be published.