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 ...

!"#$%&'$( KI;"'$()5%*&" &3" +-%8& #$#"% -( 53-:3 -& 5$8 I"'*(8&%$&"I &3$& !UK V!"#$%&'(#)*+,"'+ .+'/W)8&%$(I8 :*2;I X")$##;-"I +*% I"$;-(/ 5-&3 8*;2&-*(8 &* $( -(8&$(:" *+ &3" UYD:*'#;"&" Z$'-;&*(-$( #$&3 #%*X;"' VZYYW@) [-#&*()5%*&" &3" 8":*(I) #$#"% -( 53-:3 -& 5$8 83*5() &3$& &3" KI;"'$( &":3(-\2"8 :*2;I $;8* X" 28"I &* 8*;7-(/ &3") UYD:*'#;"&") 8$&-8+-$X-;-&9 V1K4W) #%*X;"' V&3") +-%8&) UYD...

We describe here an optical device, based on time-delays, for solving the set splitting problem which is well-known NP-complete problem. The device has a graph-like structure and the light is traversing it from a start node to a destination node. All possible (potential) paths in the graph are generated and at the destination we will check which one satisfies completely the problem’s constrains.

Communication protocols issues are one of the effective factors in communicated networks performance. One of challenging problem in CMT-SCTP which sends data by multipath concurrently is Receive Buffer Blocking. This problem has important role in data transmission speed in computer networks. In this paper, we propose a control method based on fuzzy logic so that can solve Receive Buffer Blockin...

We construct new approximation algorithms for Max Set Splitting and Max Not-All-Equal Sat, which when combined with existing algorithms give the best approximation results so far for these problems. Furthermore, when analyzing our combination of approximation algorithms, we introduce a novel technique, which improves the analysis of the performance ratio of such algorithms. In contrast with pre...

In the p-Set Splitting problem we are given a universe U , a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that there are at least k sets in F that have non-empty intersection with both B and W . In this paper we study p-Set Splitting from the view point of kernelization and parameterized algorithms. Given an instance (U,F , k)...