The Generating Algorithm for Quasi-Full Steiner Trees

In this paper, the notion of quasi-full Steiner tree (QFST) is introduced which is an extension of full Steiner tree (FST). We discuss some properties of QFST,and present a generating algorithm for obtaining a QFST or denying its existence. With this algorithm we can obtain a minimum QFST that is just the Steiner minimal tree (SMT) if it has the quasi-full topology.