On algorithms for construction of all irreducible partial covers

被引：0
|
作者：
Moshkov, Mikhail Ju. [1 ]
机构：
[1] Univ Silesia, Dept Comp Sci, PL-41200 Sosnowiec, Poland
来源：
INFORMATION PROCESSING LETTERS | 2007年 / 103卷 / 02期
关键词：
irreducible partial cover; totally polynomial algorithm; computational complexity;
D O I：
10.1016/j.ipl.2007.02.009
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Lower and upper bounds on the cardinality and the number of irreducible partial covers for almost all set cover problems are obtained. These bounds allow us to prove that there is no polynomial algorithm which for almost all set cover problems constructs all irreducible partial covers, but there exists a totally polynomial algorithm which constructs all irreducible partial covers for almost all set cover problems. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：66 / 70
页数：5
相关论文
共 50 条
  • [1] On construction of the set of irreducible partial covers
    Moshkov, MJ
    [J]. STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS, PROCEEDINGS, 2005, 3777 : 38 - 44
  • [2] On greedy algorithms with weights for construction of partial covers
    Moshkov, Mikhail Ju.
    Piliszczuk, Marcin
    Zielosko, Beata
    [J]. INTELLIGENT INFORMATION PROCESSING AND WEB MINING, PROCEEDINGS, 2006, : 391 - +
  • [3] On construction of partial reducts and irreducible partial decision rules
    Moshkov, Mikhail Ju.
    Piliszczuk, Marcin
    Zielosko, Beata
    [J]. FUNDAMENTA INFORMATICAE, 2007, 75 (1-4) : 357 - 374
  • [4] Approximation Algorithms for Partial Vertex Covers in Trees
    Mkrtchyan, Vahan
    Parekh, Ojas
    Subramani, K.
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024, 35 (04) : 387 - 407
  • [5] Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
    Mkrtchyan, Vahan
    Petrosyan, Garik
    Subramani, K.
    Wojciechowski, Piotr
    [J]. COMBINATORIAL ALGORITHMS, IWOCA 2020, 2020, 12126 : 395 - 408
  • [6] Greedy Algorithms with Weights for Construction of Partial Association Rules
    Moshkov, Mikhail Ju.
    Piliszczuk, Marcin
    Zielosko, Beata
    [J]. FUNDAMENTA INFORMATICAE, 2009, 94 (01) : 101 - 120
  • [7] Conway irreducible hyperbolic knots with two common covers
    Paoluzzi, L
    [J]. COMMENTARII MATHEMATICI HELVETICI, 2005, 80 (03) : 643 - 653
  • [8] Electrocoat covers it all
    Anon
    [J]. Products Finishing (Cincinnati), 2002, 67 (02):
  • [9] On carpets, construction and covers
    Brunekreef, B
    [J]. CLINICAL AND EXPERIMENTAL ALLERGY, 1999, 29 (04): : 433 - 435
  • [10] Angle covers: Algorithms and complexity
    Evans, William
    Gethner, Ellen
    Spalding-Jamieson, Jack
    Wolff, Alexander
    [J]. 1600, Brown University (25): : 643 - 661
12345