Heuristic algorithms to construct a planar Steiner forest for a terminal representation graph

摘要

This paper proposes two heuristic algorithms MWW2 and PPM-SC to construct a planar spanning Steiner forest for a given terminal representation graph. It is shown, through comparison of experimental results in 2430 input data, that PPM-SC has higher capability than MWW2.