AN EFFICIENT ALGORITHM FOR A SPECIAL CASE OF THE SET PARTITION PROBLEM

被引：0
|
作者：
JACKSON, A
RAMANAN, P
机构：
[1] Department of Computer Science, University of California, Santa Barbara
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1990年 / 34卷 / 1-2期
关键词：
Algorithm; decision tree; deterministic finite automaton; minimization; set partition; time-complexity;
D O I：
10.1080/00207169008803858
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we study the Two Functions Set Partition Problem, which is defined as follows: Given a set S of n elements, functions f1and f2 from S to S, and an initial partition B = (B1,B2,…,BS) of S, find the coarsest refinement E = (E1 E2,… Et)of B such that for each i, i = 1,2, and j, 1≦j≦t,fi (Ej)⊑ Ek for some k. For the special case when f1consists of a single cycle, we present an 0(nβ(n)) algorithm, where β(n) is the number of distinct prime factors of n. β(n) is loglogn + 0(loglogn) for almost all n, and is Θ(logn/loglogn) in the worst case. This algorithm represents an improvement over the previously known O(n log n) algorithm. © 1990, Taylor & Francis Group, LLC. All rights reserved.
引用
收藏
页码：1 / 8
页数：8
相关论文
共 50 条
  • [21] Fault set partition for efficient width compression
    Gizdarski, E
    Fujiwara, H
    PROCEEDINGS OF THE 11TH ASIAN TEST SYMPOSIUM (ATS 02), 2002, : 194 - 199
  • [22] The linking set problem: A polynomial special case of the multiple-choice knapsack problem
    Agra A.
    Requejo C.
    Journal of Mathematical Sciences, 2009, 161 (6) : 919 - 929
  • [23] Efficient network algorithms for two special cases of the weighted set cover problem
    Tayyebi, Javad
    Mohammadi, Abumoslem
    INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT, 2018, 13 (03) : 209 - 214
  • [24] An Efficient Partition of Training Data Set Improves Speed and Accuracy of Cascade-correlation Algorithm
    Igor V. Tetko
    Alessandro E.P. Villa
    Neural Processing Letters, 1997, 6 : 51 - 59
  • [25] An efficient partition of training data set improves speed and accuracy of cascade-correlation algorithm
    Tetko, IV
    Villa, AEP
    NEURAL PROCESSING LETTERS, 1997, 6 (1-2) : 51 - 59
  • [26] An exact algorithm for the Partition Coloring Problem
    Furini, Fabio
    Malaguti, Enrico
    Santini, Alberto
    COMPUTERS & OPERATIONS RESEARCH, 2018, 92 : 170 - 181
  • [27] An Efficient Algorithm for Judicious Partition of Hypergraphs
    Tan, Tunzi
    Gui, Jihong
    Wang, Sainan
    Gao, Suixiang
    Yang, Wenguo
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2017, PT II, 2017, 10628 : 466 - 474
  • [28] A LINEAR-TIME ALGORITHM FOR A SPECIAL CASE OF DISJOINT SET UNION
    GABOW, HN
    TARJAN, RE
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 30 (02) : 209 - 221
  • [29] Partition Independent Set and Reduction-Based Approach for Partition Coloring Problem
    Zhu, Enqiang
    Jiang, Fei
    Liu, Chanjuan
    Xu, Jin
    IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (06) : 4960 - 4969
  • [30] A modified genetic algorithm for a special case of the generalized assignment problem
    Dorterler, Murat
    Bay, Omer Faruk
    Akcayol, Mehmet Ali
    TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2017, 25 (02) : 794 - 805
12345