NONPROLIFERATION POLICY CROSSROADS:

On October 1, 2008, Congress enacted a proposal that originated with President George W. Bush in 2005 to approve an unprecedented nuclear trade pact with India by removing a central pillar of US nonproliferation policy. Despite the numerous political challenges confronting the Bush administration, the initiative won strong bipartisan support, including votes from Democratic Senators Joseph Biden, Hillary Clinton, and Barack Obama. The four-year struggle to pass the controversial US-India nuclear trade agreement offers an exceptionally valuable case study. It demonstrates a classic tradeoff between the pursuit of broad multilateral goals such as nuclear nonproliferation and advancement of a specific bilateral relationship. It reveals enduring fault lines in executive branch relations with Congress. It vividly portrays challenges confronting proponents of a strong nonproliferation regime. This article is based on an analysis of the negotiating record and congressional deliberations, including interviews with key participants. It assesses the lessons learned and focuses on three principal questions: how did the agreement seek to advance US national security interests?; what were the essential elements of the prolonged state-of-the-art lobbying campaign to win approval from skeptics in Congress?; and what are the agreement's actual benefits—and costs—to future US nonproliferation efforts?     

The Interplay of Domestic Legitimation and Foreign Relations: Contrasting Charles Taylor and Ellen Johnson Sirleaf of Liberia

This article investigates legitimacy and foreign relations of Liberia’s two most important recent rulers. It argues that Charles Taylor was widely considered legitimate in Liberia and that the Weberian concept of charismatic authority best explains the popularity of the former warlord and president. Charisma, however, is tied to specific cultural contexts and Taylor’s popularity was not intelligible to Western audiences. By contrast, Johnson Sirleaf frames her policies in terms appealing to both the domestic and international audiences. As a consequence, she succeeded to attract significant foreign assistance enabling her to increase legitimacy and strengthen stability.     

Decomposition algorithms for the maximum-weight connected graph problem

Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph problem (MCG) is to find a connected subgraph with R vertices that maximizes the sum of their weights. MCG has applications to communication network design and facility expansion. The constrained MCG (CMCG) is MCG with a constraint that one predetermined vertex must be included in the solution. In this paper, we introduce a class of decomposition algorithms for MCG. These algorithms decompose MCG into a number of small CMCGs by adding vertices one at a time and building a partial graph. They differ in the ordering of adding vertices. Proving that finding an ordering that gives the minimum number of CMCGs is NP-complete, we present three heuristic algorithms. Experimental results show that these heuristics are very effective in reducing computation and that different orderings can significantly affect the number of CMCGs to be solved. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 817–837, 1998     

Algorithms for the constrained maximum-weight connected graph problem

Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph (MCG) problem is to find a connected subgraph with R vertices that maximizes the sum of the weights. The MCG problem is strongly NP-complete, and we study a special case of it: the constrained MCG (CMCG) problem, which is the MCG problem with a constraint of having a predetermined vertex included in the solution. We first show that the Steiner tree problem is a special case of the CMCG problem. Then we present three optimization algorithms for the CMCG problem. The first two algorithms deal with special graphs (tree and layered graphs) and employ different dynamic programming techniques, solving the CMCG problem in polynomial times. The third one deals with a general graph and uses a variant of the Balas additive method with an imbedded connectivity test and a pruning method. We also present a heuristic algorithm for the CMCG problem with a general graph and its bound analysis. We combine the two algorithms, heuristic and optimization, and present a practical solution method to the CMCG problem. Computational results are reported and future research issues are discussed. © 1996 John Wiley & Sons, Inc.