scholarly journals Establishing Pathways to Democracy Using Domination Analysis

2020 ◽  
Author(s):  
Amanda Edgell ◽  
Vanessa A. Boese ◽  
Seraphine F. Maerz ◽  
Patrik Lindenfors ◽  
Staffan I. Lindberg
Keyword(s):  
Domination Analysis

scholarly journals Traveling Salesman Should not be Greedy: Domination Analysis of Greedy-Type Heuristics for the TSP

2001 ◽  
Vol 8 (6) ◽  
Author(s):  
Gregory Gutin ◽  
Anders Yeo ◽  
Alexey Zverovich
Keyword(s):  
Greedy Algorithm ◽  
Nearest Neighbor ◽  
Sharp Contrast ◽  
Traveling Salesman ◽  
Acceptable Level ◽  
Computational Experiments ◽  
Nearest Neighbor Algorithm ◽  
Domination Analysis ◽  
The Greedy Algorithm

<p>Computational experiments show that the greedy algorithm (GR)<br />and the nearest neighbor algorithm (NN), popular choices for tour <br />construction heuristics, work at acceptable level for the Euclidean TSP,<br />but produce very poor results for the general Symmetric and Asymmetric<br /> TSP (STSP and ATSP). We prove that for every n >= 2 there<br />is an instance of ATSP (STSP) on n vertices for which GR finds the<br />worst tour. The same result holds for NN. We also analyze the repetitive<br /> NN (RNN) that starts NN from every vertex and chooses the best<br />tour obtained. We prove that, for the ATSP, RNN always produces<br />a tour, which is not worse than at least n/2 − 1 other tours, but for<br />some instance it finds a tour, which is not worse than at most n − 2<br />other tours, n >= 4. We also show that, for some instance of the STSP<br />on n >= 4 vertices, RNN produces a tour not worse than at most 2^(n−3) tours. These results are in sharp contrast to earlier results by G. Gutin and A. Yeo, and A. Punnen and S. Kabadi, who proved that, for the ATSP, there are tour construction heuristics, including some popular ones, that always build a tour not worse than at least (n − 2)! tours.</p><p>Keywords: TSP, domination analysis, greedy algorithm, nearest<br />neighbor algorithm</p>

scholarly journals The Institutional Order of Liberalization

2021 ◽  
pp. 1-7
Author(s):  
Amanda B. Edgell ◽  
Vanessa A. Boese ◽  
Seraphine F. Maerz ◽  
Patrik Lindenfors ◽  
Staffan I. Lindberg
Keyword(s):  
Democratic Transition ◽  
Transition To Democracy ◽  
Authoritarian Regimes ◽  
Democratic Institutions ◽  
Clear Pattern ◽  
Domination Analysis ◽  
Institutional Order

Abstract When authoritarian regimes liberalize, are there observable patterns in the ordering of reforms, and are these patterns distinct for cases that transition to democracy? While the prevailing literature tends to focus on exogenous ‘determinants’ of democracy, this letter describes the endogenous dynamics of liberalization itself. Using pairwise domination analysis, it assesses the institutional order of reforms during 371 episodes of liberalization in autocracies between 1900 and 2019. Based on twenty-four indicators of democratic institutions and practices, our findings reveal (1) a clear pattern of reform during liberalization episodes, (2) with strong similarities across outcomes, but also that (3) reforms to the administration of elections tend to develop comparatively earlier in episodes of liberalization that produce a democratic transition.

scholarly journals Domination analysis for minimum multiprocessor scheduling

2006 ◽  
Vol 154 (18) ◽  
pp. 2613-2619 ◽  
Author(s):  
Gregory Gutin ◽  
Tommy Jensen ◽  
Anders Yeo
Keyword(s):  
Multiprocessor Scheduling ◽  
Domination Analysis

TSP Heuristics: Domination Analysis and Complexity

Algorithmica ◽  
2003 ◽  
Vol 35 (2) ◽  
pp. 111-127 ◽  
Author(s):  
Punnen ◽  
Margot ◽  
Kabadi
Keyword(s):  
Domination Analysis
Sign in / Sign up

Export Citation Format

Share Document