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 条
  • [31] A reinforcement learning based computational intelligence approach for binary optimization problems: The case of the set-union knapsack problem
    Ozsoydan, Fehmi Burcin
    Golcuk, Ilker
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 118
  • [32] Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters
    Egert, Rolf
    Fischlin, Marc
    Gens, David
    Jacob, Sven
    Senker, Matthias
    Tillmanns, Joern
    INFORMATION SECURITY AND PRIVACY (ACISP 2015), 2015, 9144 : 413 - 430
  • [33] A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem
    Garcia, Jose
    Lemus-Romani, Jose
    Altimiras, Francisco
    Crawford, Broderick
    Soto, Ricardo
    Becerra-Rozas, Marcelo
    Moraga, Paola
    Paz Becerra, Alex
    Pena Fritz, Alvaro
    Rubio, Jose-Miguel
    Astorga, Gino
    MATHEMATICS, 2021, 9 (20)
  • [34] A Persistent Union-Find Data Structure
    Conchon, Sylvain
    Filliatre, Jean-Christophe
    ML'07: PROCEEDINGS OF THE 2007 WORKSHOP ON ML, 2007, : 37 - +
  • [35] FULLY PERSISTENT DATA-STRUCTURES FOR DISJOINT SET UNION PROBLEMS
    ITALIANO, GF
    SARNAK, N
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 519 : 449 - 460
  • [36] THE SET UNION PROBLEM WITH BACKTRACKING
    MANNILA, H
    UKKONEN, E
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 226 : 236 - 243
  • [37] NEW DATA STRUCTURE FOR THE UNION-FIND PROBLEM
    LAO, MJ
    INFORMATION PROCESSING LETTERS, 1979, 9 (01) : 39 - 45
  • [38] Communication-Efficient and Privacy-Preserving Protocol for Computing Over-Threshold Set-Union
    Gong, Xuhui
    Hua, Qiang-sheng
    Jin, Hai
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, PT I, 2020, 12384 : 121 - 133
  • [39] A note on the set union knapsack problem
    Arulselvan, Ashwin
    DISCRETE APPLIED MATHEMATICS, 2014, 169 : 214 - 218
  • [40] THE SET UNION PROBLEM WITH UNLIMITED BACKTRACKING
    APOSTOLICO, A
    ITALIANO, GF
    GAMBOSI, G
    TALAMO, M
    SIAM JOURNAL ON COMPUTING, 1994, 23 (01) : 50 - 70
12345