A PARTIALLY PERSISTENT DATA STRUCTURE FOR THE SET-UNION PROBLEM

被引：0
|
作者：
GAIBISSO, C
GAMBOSI, G
TALAMO, M
机构：
来源：
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS | 1990年 / 24卷 / 02期
关键词：
D O I：
10.1051/ita/1990240201891
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：189 / 202
页数：14
相关论文
共 50 条
  • [1] A PARTIALLY PERSISTENT DATA STRUCTURE FOR THE SET-UNION PROBLEM WITH BACKTRACKING
    GAIBISSO, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 381 : 128 - 135
  • [2] On the complexity of a set-union problem
    Lipton, RJ
    Martino, PJ
    Neitzke, A
    38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 110 - 115
  • [3] Note: on the set-union knapsack problem
    Goldschmidt, O.
    Nehme, D.
    Yu, G.
    Naval Research Logistics, 1994, 41 (06)
  • [4] ON THE SET-UNION KNAPSACK-PROBLEM
    GOLDSCHMIDT, O
    NEHME, D
    YU, G
    NAVAL RESEARCH LOGISTICS, 1994, 41 (06) : 833 - 842
  • [5] A Cooperative Method for Solving the Set-Union Knapsack Problem
    Zhao, Juntao
    Hifi, Mhand
    2024 10TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES, CODIT 2024, 2024, : 1219 - 1224
  • [6] Kernel based tabu search for the Set-union Knapsack Problem
    Wei, Zequn
    Hao, Jin-Kao
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 165
  • [7] WORST-CASE ANALYSIS OF THE SET-UNION PROBLEM WITH EXTENDED BACKTRACKING
    GAMBOSI, G
    ITALIANO, GF
    TALAMO, M
    THEORETICAL COMPUTER SCIENCE, 1989, 68 (01) : 57 - 70
  • [8] Solving the set-union knapsack problem by a novel hybrid Jaya algorithm
    Wu, Congcong
    He, Yichao
    SOFT COMPUTING, 2020, 24 (03) : 1883 - 1902
  • [9] A swarm intelligence-based algorithm for the set-union knapsack problem
    Ozsoydan, Fehmi Burcin
    Baykasoglu, Adil
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2019, 93 : 560 - 569
  • [10] Solving the set-union knapsack problem by a novel hybrid Jaya algorithm
    Congcong Wu
    Yichao He
    Soft Computing, 2020, 24 : 1883 - 1902
12345