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 条
  • [21] Parallel algorithm for the integer knapsack problem
    Universidad de La Laguna, Tenerife, Spain
    Concurrency Pract Exper, 4 (251-260):
  • [22] A parallel algorithm for the integer knapsack problem
    Morales, D
    Roda, JL
    Rodriguez, C
    Almeida, F
    Garcia, F
    CONCURRENCY-PRACTICE AND EXPERIENCE, 1996, 8 (04): : 251 - 260
  • [23] ON PARALLEL COMPUTATION FOR THE KNAPSACK-PROBLEM
    YAO, ACC
    JOURNAL OF THE ACM, 1982, 29 (03) : 898 - 903
  • [24] A PARALLEL ALGORITHM FOR THE KNAPSACK-PROBLEM
    KARNIN, ED
    IEEE TRANSACTIONS ON COMPUTERS, 1984, 33 (05) : 404 - 408
  • [25] Parallel algorithms and complexity
    Furer, M
    PARALLEL COMPUTING IN OPTIMIZATION, 1997, 7 : 27 - 55
  • [26] A STUDY ON THE COMPUTATIONAL COMPLEXITY OF THE BILEVEL KNAPSACK PROBLEM
    Caprara, Alberto
    Carvalho, Margarida
    Lodi, Andrea
    Woeginger, Gerhard J.
    SIAM JOURNAL ON OPTIMIZATION, 2014, 24 (02) : 823 - 838
  • [27] THE COMPLEXITY OF LIFTED INEQUALITIES FOR THE KNAPSACK-PROBLEM
    HARTVIGSEN, D
    ZEMEL, E
    DISCRETE APPLIED MATHEMATICS, 1992, 39 (02) : 113 - 123
  • [28] Exact algorithms for the 0-1 Time-Bomb Knapsack Problem
    Monaci, Michele
    Pike-Burke, Ciara
    Santini, Alberto
    COMPUTERS & OPERATIONS RESEARCH, 2022, 145
  • [29] Lexicographic α-robust knapsack problem :: Complexity results
    Kalai, Rim
    Vanderpooten, Daniel
    2006 INTERNATIONAL CONFERENCE ON SERVICE SYSTEMS AND SERVICE MANAGEMENT, VOLS 1 AND 2, PROCEEDINGS, 2006, : 1103 - 1107
  • [30] Algorithms and time complexity of the request-service problem
    Chunmei Liu
    Legand Burge
    Ajoni Blake
    Journal of Combinatorial Optimization, 2010, 20 : 180 - 193
12345