Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model
This article describes the Wellness Profile Model. The two decision problems related to the model called the Compatible Wellness Group with Target Member Problem and the Compatible Wellness Group Problem are defined. We propose the two polynomial-time algorithms for solving the two problems here. Ou...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2015
|
| Online Access: | http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84905376914&origin=inward http://cmuir.cmu.ac.th/handle/6653943832/39045 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| id |
th-cmuir.6653943832-39045 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-390452015-06-16T08:01:20Z Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model Juneam,N. Kantabutra,S. This article describes the Wellness Profile Model. The two decision problems related to the model called the Compatible Wellness Group with Target Member Problem and the Compatible Wellness Group Problem are defined. We propose the two polynomial-time algorithms for solving the two problems here. Our main contribution is to show that the time complexities of these two problems are in class P. © 2014 IEEE. 2015-06-16T08:01:20Z 2015-06-16T08:01:20Z 2014-01-01 Conference Paper 2-s2.0-84905376914 10.1109/ECTICon.2014.6839741 http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84905376914&origin=inward http://cmuir.cmu.ac.th/handle/6653943832/39045 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| description |
This article describes the Wellness Profile Model. The two decision problems related to the model called the Compatible Wellness Group with Target Member Problem and the Compatible Wellness Group Problem are defined. We propose the two polynomial-time algorithms for solving the two problems here. Our main contribution is to show that the time complexities of these two problems are in class P. © 2014 IEEE. |
| format |
Conference or Workshop Item |
| author |
Juneam,N. Kantabutra,S. |
| spellingShingle |
Juneam,N. Kantabutra,S. Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model |
| author_facet |
Juneam,N. Kantabutra,S. |
| author_sort |
Juneam,N. |
| title |
Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model |
| title_short |
Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model |
| title_full |
Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model |
| title_fullStr |
Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model |
| title_full_unstemmed |
Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model |
| title_sort |
time complexity of finding compatible wellness groups in the wellness profile model |
| publishDate |
2015 |
| url |
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84905376914&origin=inward http://cmuir.cmu.ac.th/handle/6653943832/39045 |
| _version_ |
1681421583438053376 |