Steiner's problem in graphs: heuristic methods

AbstractReal world problems arising in the layout of connection structures in networks as e.g. in VLSI design may often be decomposed into a number of well-known combinatorial optimization problems.Steiner's problem in graphs is included within this context. According to its complexity one is interested in developing efficient heuristic algorithms to find good approximate solutions. Here a comparison of various heuristic methods for Steiner's problem in graphs is presented