TIME-VARYING CHARACTERISTICS OF SOUTH KOREA-UNITED STATES AND JAPAN-UNITED STATES MILITARY ALLIANCES UNDER CHINESE THREAT: A PUBLIC GOOD APPROACH

This paper investigates the nature of two military alliances under Chinese threat. The findings are as follows: First, South Korea does not consider China a significant threat while Japan and the United States have recognized China as a serious threat since the 1990s and the 2000s, respectively. Second, the relationship between South Korea and the United States is a true military alliance for all time periods, but the nature of the alliance has changed since the 1970s. Third, although Japan began to form an alliance relationship with the United States in the 1990s, Japan is considered a more significant ally by the United States. This paper implies that, should China provoke a military confrontation, it might be difficult to deduce a common solution among the three countries because of the different response to military threats from China.     

Command Coordination and Tactical Effectiveness in Counter-insurgency Operations: Lessons from the South Korean Campaign

This article analyzes the causes of combat effectiveness of the South Korean security forces through the course of its various counter-insurgency (COIN) operations from 1948 to 1953. We argue that improvements in two interrelated aspects ultimately resulted in higher operational and tactical level performance: unified operational command structure and the subsequent improvements in tactical efficiency under the guidance of the US advisory mission. Through an in-depth case study on how a nascent army improved its capacity in combating homegrown insurgencies, we demonstrate how the actual conduct of operations itself remains just as significant in the assessment of overall COIN outcomes.     

Network disconnection problems in a centralized network

We consider three network disconnection problems in a centralized network where a source node provides service to the other nodes, called demand nodes. In network disconnection problems, each demand node gets a certain benefit when connected to a source node and a network attacker destroys edges to prevent demand nodes from achieving benefits. As destroying edges incurs expenses, an attacker considers the following three different strategies. The first is to maximize the sum of benefits of the disconnected nodes while keeping the total edge destruction cost no more than a given budget. The second is to minimize the total destruction cost needed to make a certain amount of benefits not accomplished. The last is to minimize the ratio of the total destruction cost to the benefits not accomplished. In this paper, we develop exact algorithms to solve the above three problems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007