在健康档案模型中寻找相容健康团体的时间复杂度

2014 11th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON) Pub Date : 2014-05-14 DOI:10.1109/ECTICON.2014.6839741

Nopadon Juneam, Sanpawat Kantabutra

{"title":"在健康档案模型中寻找相容健康团体的时间复杂度","authors":"Nopadon Juneam, Sanpawat Kantabutra","doi":"10.1109/ECTICON.2014.6839741","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":347166,"journal":{"name":"2014 11th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)","volume":"124 1-2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Time complexity of finding Compatible Wellness Groups in the Wellness Profile Model\",\"authors\":\"Nopadon Juneam, Sanpawat Kantabutra\",\"doi\":\"10.1109/ECTICON.2014.6839741\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":347166,\"journal\":{\"name\":\"2014 11th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)\",\"volume\":\"124 1-2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 11th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ECTICON.2014.6839741\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 11th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECTICON.2014.6839741","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文描述了健康概要模型。定义了与该模型相关的两个决策问题，即具有目标成员的相容健康组问题和相容健康组问题。我们提出了两种多项式时间算法来解决这两个问题。我们的主要贡献是证明了这两个问题的时间复杂度属于P类。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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. Our main contribution is to show that the time complexities of these two problems are in class P.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2014 11th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)

自引率

0.00%

发文量