Abstract: Steiner tree in a graph is a subgraph, that covers all of previously selected nodes called Terminals. This problem can be applied e. g. to design subnetworks within some existing infrastructures. Although, several Steiner tree algorithms have been published, there is always a trade off between speed and accuracy. Here, we propose some optimizations to a simple Distance Network Heuristic algorithm to increase its speed while maintaining the solution quality.