In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section of this paper we introduce "Fast Split" algorithm.
Heidari, M., Golshani, A., Moazzami, D., & Moeini, A. (2016). Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model. Journal of Algorithms and Computation, 47(1), 79-92. doi: 10.22059/jac.2016.7944
MLA
Mahdi Heidari; Ali Golshani; D. Moazzami; Ali Moeini. "Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model". Journal of Algorithms and Computation, 47, 1, 2016, 79-92. doi: 10.22059/jac.2016.7944
HARVARD
Heidari, M., Golshani, A., Moazzami, D., Moeini, A. (2016). 'Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model', Journal of Algorithms and Computation, 47(1), pp. 79-92. doi: 10.22059/jac.2016.7944
VANCOUVER
Heidari, M., Golshani, A., Moazzami, D., Moeini, A. Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model. Journal of Algorithms and Computation, 2016; 47(1): 79-92. doi: 10.22059/jac.2016.7944
)