Analyzing time complexity of parallel algorithms for knapsack problem

被引：0
|
作者：
Padmavathi, S. [1 ]
Shalinie, S. Mercy [1 ]
机构：
[1] Thaigarajar Coll Engn, Dept Comp Sci & Engn, Madurai 15, Tamil Nadu, India
来源：
2007 INTERNATIONAL CONFERENCE OF SIGNAL PROCESSING, COMMUNICATIONS AND NETWORKING, VOLS 1 AND 2 | 2006年
关键词：
parallel algorithm; approximation algorithm; dynamic programming; polynomial time;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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 it's 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.
引用
收藏
页码：218 / +
页数：2
相关论文
共 50 条
  • [1] Comments on parallel algorithms for the knapsack problem
    Sanches, CAA
    Soma, NY
    Yanasse, HH
    PARALLEL COMPUTING, 2002, 28 (10) : 1501 - 1505
  • [2] APPROXIMATE ALGORITHMS FOR THE KNAPSACK-PROBLEM ON PARALLEL COMPUTERS
    GOPALAKRISHNAN, PS
    RAMAKRISHNAN, IV
    KANAL, LN
    INFORMATION AND COMPUTATION, 1991, 91 (02) : 155 - 171
  • [3] Work and memory-efficient parallel algorithms for the knapsack problem
    Ferreira, A
    INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 1995, 7 (04): : 595 - 606
  • [4] Optimal parallel algorithms for the knapsack problem without memory conflicts
    Ken-Li Li
    Ren-Fa Li
    Qing-Hua Li
    Journal of Computer Science and Technology, 2004, 19 : 760 - 768
  • [5] On the Advice Complexity of the Knapsack Problem
    Boeckenhauer, Hans-Joachim
    Komm, Dennis
    Kralovic, Richard
    Rossmanith, Peter
    LATIN 2012: THEORETICAL INFORMATICS, 2012, 7256 : 61 - 72
  • [6] On linear-time algorithms for the continuous quadratic knapsack problem
    Kiwiel, K. C.
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2007, 134 (03) : 549 - 554
  • [7] On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem
    K. C. Kiwiel
    Journal of Optimization Theory and Applications, 2007, 134 : 549 - 554
  • [8] BPSO Algorithms for Knapsack Problem
    Gherboudj, Amira
    Chikhi, Salim
    RECENT TRENDS IN WIRELESS AND MOBILE NETWORKS, 2011, 162 : 217 - 227
  • [9] Some techniques for analyzing time complexity of evolutionary algorithms
    Ding, Lixin
    Yu, Jinghu
    TRANSACTIONS OF THE INSTITUTE OF MEASUREMENT AND CONTROL, 2012, 34 (06) : 755 - 766
  • [10] Complexity indices for the multidimensional knapsack problem
    Derpich, Ivan
    Herrera, Carlos
    Sepulveda, Felipe
    Ubilla, Hugo
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2021, 29 (02) : 589 - 609
12345