• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1707-1718
• /
• 1996

Given a signal net N=s, 1,...,n to be the set of nodes, with s the source and the remaining nodes sinks, an MRDPT (minimum-cost rectilinear Steiner distance -preserving tree) has the property that the length of every source to sink path is equal to the rectilinear distance between the source and sink. The minimum- cost rectilinear Steiner distance-preserving tree minimizes the total wore length while maintaining minimal source to sink length. Recently, some heuristic algorithms have been proposed for the problem offending the MRDPT. In this paper, we investigate an optimal structure on the MRDPT and present a theoretical breakthrough which shows that the min-cost flow formulation leads to an efficient O(n2logm)2) time algorithm. A more practical extension is also in vestigated along with interesting open problems.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2009.10a
• /
• pp.536-537
• /
• 2009

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.3
• /
• pp.250-254
• /
• 2013

Faster and cheaper transportation of the war supplies to the frontlines is essential for winning a war. This paper proposes a method to select the optimal location of the strategic military base, e.g., the Quartermaster Corps, that minimally connects three frontlines using the optimization technique. The results are also compared to the Steiner Tree theoty.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2002.06a
• /
• pp.53-53
• /
• 2002

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.500-508
• /
• 2009

We have designed an algorithm for a problem in multicast communication. The problem is to construct a multicast tree while minimizing its cost, which is known to be NP-complete. Our algorithm, which employs new concepts defined as potential cost and spanning cost, generates a multicast tree more efficiently than the well-known heuristic called Takahashi and Matsuyama (TM) [1] in terms of tree cost. The time complexity of our algorithm is O($kn^2$) for an n-node network with k members in the multicast group and is comparable to the TM. Our empirical performance evaluation comparing the proposed algorithm with TM shows that the enhancement is up to 1.25%~4.23% for each best case.