Variants of Cyclic Three Dimensional Matching Problems
نویسندگان
چکیده
Abstract. The variants of Cyclic Three Dimensional Matching problem is introduced in this paper, which studies about matching elements of three sets of elements. The problem is solved using solid assignment technique, considering the Preference value of members. The Reduction method is applied to the assignment table and the findings were discussed with the real life problems for better understanding of the readers.
منابع مشابه
It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems
In 1976, Knuth [14] asked if the stable marriage problem (SMP) can be generalized to marriages consisting of 3 genders. In 1988, Alkan [1] showed that the natural generalization of SMP to 3 genders (3GSM) need not admit a stable marriage. Three years later, Ng and Hirschberg [16] proved that it is NP-complete to determine if given preferences admit a stable marriage. They further prove an analo...
متن کاملOne-in-Two-Matching Problem is NP-complete
2-dimensional Matching Problem, which requires to find a matching of leftto rightvertices in a balanced 2n-vertex bipartite graph, is a well-known polynomial problem, while various variants, like the 3-dimensional analogoue (3DM, with triangles on a tripartite graph), or the Hamiltonian Circuit Problem (HC, a restriction to “unicyclic” matchings) are among the main examples of NP-hard problems,...
متن کاملSome notes on the characterization of two dimensional skew cyclic codes
A natural generalization of two dimensional cyclic code ($T{TDC}$) is two dimensional skew cyclic code. It is well-known that there is a correspondence between two dimensional skew cyclic codes and left ideals of the quotient ring $R_n:=F[x,y;rho,theta]/_l$. In this paper we characterize the left ideals of the ring $R_n$ with two methods and find the generator matrix for two dimensional s...
متن کاملThree-dimensional stable matching with cyclic preferences
We consider stable three-dimensional matchings of three genders (3GSM). Alkan [Alkan, A., 1988. Nonexistence of stable threesome matchings. Mathematical Social Sciences 16, 207–209] showed that not all instances of 3GSM allow stable matchings. Boros et al. [Boros, E., Gurvich, V., Jaslar, S., Krasner, D., 2004. Stable matchings in three-sided systems with cyclic preferences. Discrete Mathematic...
متن کاملThree-sided stable matchings with cyclic preferences and the kidney exchange problem
Knuth [14] asked whether the stable matching problem can be generalised to three dimensions i. e., for families containing a man, a woman and a dog. Subsequently, several authors considered the three-sided stable matching problem with cyclic preferences, where men care only about women, women only about dogs, and dogs only about men. In this paper we prove that if the preference lists may be in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015