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 条
  • [31] Algorithms and time complexity of the request-service problem
    Liu, Chunmei
    Burge, Legand
    Blake, Ajoni
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2010, 20 (02) : 180 - 193
  • [32] Complexity Results and Exact Algorithms for Robust Knapsack Problems
    Fabrice Talla Nobibon
    Roel Leus
    Journal of Optimization Theory and Applications, 2014, 161 : 533 - 552
  • [33] Complexity Results and Exact Algorithms for Robust Knapsack Problems
    Nobibon, Fabrice Talla
    Leus, Roel
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2014, 161 (02) : 533 - 552
  • [34] Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
    Hasan, Osman
    Tahar, Sofiene
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2010, 25 (06) : 1305 - 1320
  • [35] Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
    Osman Hasan
    Sofiène Tahar
    Journal of Computer Science and Technology, 2010, 25 : 1305 - 1320
  • [36] Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
    Osman Hasan
    Sofiène Tahar
    Journal of Computer Science & Technology, 2010, 25 (06) : 1305 - 1320
  • [37] Automatic Generation of Algorithms for the Binary Knapsack Problem
    Parada, Lucas
    Sepulveda, Mauricio
    Herrera, Carlos
    Parada, Victor
    2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 3148 - 3152
  • [38] Analysis of Quality Diversity Algorithms for the Knapsack Problem
    Nikfarjam, Adel
    Anh Viet Do
    Neumann, Frank
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XVII, PPSN 2022, PT II, 2022, 13399 : 413 - 427
  • [39] Optimization algorithms for the disjunctively constrained knapsack problem
    Mariem Ben Salem
    Raouia Taktak
    A. Ridha Mahjoub
    Hanêne Ben-Abdallah
    Soft Computing, 2018, 22 : 2025 - 2043
  • [40] Some exact algorithms for the knapsack sharing problem
    Yamada, T
    Futakawa, M
    Kataoka, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (01) : 177 - 183
12345