KJCKorea
Journal Central

@article{ART002064522},
author={Sang-Un, Lee},
title={A Divide-and-Conquer Algorithm for Rigging Elections Problem},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2015},
volume={20},
number={12},
pages={101-106}

TY - JOUR
AU - Sang-Un, Lee
TI - A Divide-and-Conquer Algorithm for Rigging Elections Problem
JO - Journal of The Korea Society of Computer and Information
PY - 2015
VL - 20
IS - 12
PB - The Korean Society Of Computer And Information
SP - 101
EP - 106
SN - 1598-849X
AB - This paper suggests heuristic algorithm with polynomial time complexity for rigging elections problem that can be obtain the optimal solution using linear programming. The proposed algorithm transforms the given problem into adjacency graph. Then, we divide vertices V into two set W and D . The set D contains majority distinct and the set D contains minority area. This algorithm applies divide-and-conquer method that the minority area D is include into majority distinct W . While this algorithm using simple rule, that can be obtains the optimal solution equal to linear programing for experimental data. This paper shows polynomial time solution finding rule potential in rigging elections problem.
KW - Majority;Minority;Adjacency graph;Divide-and-conquer;Rigging elections
DO -
UR -
ER -

Sang-Un, Lee. (2015). A Divide-and-Conquer Algorithm for Rigging Elections Problem. Journal of The Korea Society of Computer and Information, 20(12), 101-106.

Sang-Un, Lee. 2015, "A Divide-and-Conquer Algorithm for Rigging Elections Problem", Journal of The Korea Society of Computer and Information, vol.20, no.12 pp.101-106.

Sang-Un, Lee "A Divide-and-Conquer Algorithm for Rigging Elections Problem" Journal of The Korea Society of Computer and Information 20.12 pp.101-106 (2015) : 101.

Sang-Un, Lee. A Divide-and-Conquer Algorithm for Rigging Elections Problem. 2015; 20(12), 101-106.

Sang-Un, Lee. "A Divide-and-Conquer Algorithm for Rigging Elections Problem" Journal of The Korea Society of Computer and Information 20, no.12 (2015) : 101-106.

Sang-Un, Lee. A Divide-and-Conquer Algorithm for Rigging Elections Problem. Journal of The Korea Society of Computer and Information, 20(12), 101-106.

Sang-Un, Lee. A Divide-and-Conquer Algorithm for Rigging Elections Problem. Journal of The Korea Society of Computer and Information. 2015; 20(12) 101-106.

Sang-Un, Lee. A Divide-and-Conquer Algorithm for Rigging Elections Problem. 2015; 20(12), 101-106.

Sang-Un, Lee. "A Divide-and-Conquer Algorithm for Rigging Elections Problem" Journal of The Korea Society of Computer and Information 20, no.12 (2015) : 101-106.