背包问题并行算法的时间复杂度分析

2007 International Conference on Signal Processing, Communications and Networking Pub Date : 2007-11-05 DOI:10.1109/ICSCN.2007.350734

S. Padmavathi, S. Mercy Shalinie

{"title":"背包问题并行算法的时间复杂度分析","authors":"S. Padmavathi, S. Mercy Shalinie","doi":"10.1109/ICSCN.2007.350734","DOIUrl":null,"url":null,"abstract":"In this paper, we have analyzed various parallel algorithms for solving knapsack problem and proposed an efficient approach for solving knapsack problem using an approximation algorithm. We also discussed the time complexity of different algorithm. Backtracking is not discussed here due to its inherent sequential property. The validity of the proposed algorithm is demonstrated on a worked out example and it shows the superiority of the proposed algorithm","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"144 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analyzing Time Complexity of Parallel Algorithms for Knapsack Problem\",\"authors\":\"S. Padmavathi, S. Mercy Shalinie\",\"doi\":\"10.1109/ICSCN.2007.350734\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we have analyzed various parallel algorithms for solving knapsack problem and proposed an efficient approach for solving knapsack problem using an approximation algorithm. We also discussed the time complexity of different algorithm. Backtracking is not discussed here due to its inherent sequential property. The validity of the proposed algorithm is demonstrated on a worked out example and it shows the superiority of the proposed algorithm\",\"PeriodicalId\":257948,\"journal\":{\"name\":\"2007 International Conference on Signal Processing, Communications and Networking\",\"volume\":\"144 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Signal Processing, Communications and Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSCN.2007.350734\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Signal Processing, Communications and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSCN.2007.350734","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文分析了求解背包问题的各种并行算法，提出了一种利用近似算法求解背包问题的有效方法。讨论了不同算法的时间复杂度。由于回溯的固有顺序性质，这里不讨论回溯。算例验证了该算法的有效性，表明了该算法的优越性

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

查看原文本刊更多论文

Analyzing Time Complexity of Parallel Algorithms for Knapsack Problem

In this paper, we have analyzed various parallel algorithms for solving knapsack problem and proposed an efficient approach for solving knapsack problem using an approximation algorithm. We also discussed the time complexity of different algorithm. Backtracking is not discussed here due to its inherent sequential property. The validity of the proposed algorithm is demonstrated on a worked out example and it shows the superiority of the proposed algorithm

求助全文

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

来源期刊

2007 International Conference on Signal Processing, Communications and Networking

自引率

0.00%

发文量