APPROXIMATING THE MINIMUM MAXIMAL INDEPENDENCE NUMBER

被引：77
|
作者：
HALLDORSSON, MM
机构：
[1] School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Ishikawa
来源：
INFORMATION PROCESSING LETTERS | 1993年 / 46卷 / 04期
关键词：
COMBINATORIAL PROBLEMS; APPROXIMATION ALGORITHMS;
D O I：
10.1016/0020-0190(93)90022-2
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We consider the problem of approximating the size of a minimum non-extendible independent set of a graph, also known as the minimum dominating independence number. We strengthen a result of Irving to show that there is no constant epsilon > 0 for which this problem can be approximated within a factor of n1-epsilon in polynomial time, unless P = NP. This is the strongest lower bound we are aware of for polynomial-time approximation of an unweighted NP-complete graph problem.
引用
收藏
页码：169 / 172
页数：4
相关论文
共 50 条
  • [41] Approximating minimum cocolorings
    Fomin, FV
    Kratsch, D
    Novelli, JC
    INFORMATION PROCESSING LETTERS, 2002, 84 (05) : 285 - 290
  • [42] Minimum degree, independence number and pseudo [2, b]-factors in graphs
    Bekkai, Siham
    DISCRETE APPLIED MATHEMATICS, 2014, 162 : 108 - 114
  • [43] The minimum signless Laplacian spectral radius of graphs with given independence number
    Li, Ruilin
    Shi, Jinsong
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2010, 433 (8-10) : 1614 - 1622
  • [44] The Method of Construction the Approximating Function with Multiple Arguments with Minimum Number of Parameters and with Given Accuracy
    Shtunder, Oksana
    Dyvak, Mykola
    Manzhula, Volodymyr
    Shevchuk, Ruslan
    2013 12TH INTERNATIONAL CONFERENCE ON THE EXPERIENCE OF DESIGNING AND APPLICATION OF CAD SYSTEMS IN MICROELECTRONICS (CADSM 2013), 2013, : 329 - 331
  • [45] Independence and maximal subgroups
    Weidner, M
    ILLINOIS JOURNAL OF MATHEMATICS, 1996, 40 (01) : 47 - 76
  • [46] Approximating the minimum cycle mean
    Chatterjee, Krishnendu
    Henzinger, Monika
    Krinninger, Sebastian
    Loitzenbauer, Veronika
    Raskin, Michael A.
    THEORETICAL COMPUTER SCIENCE, 2014, 547 : 104 - 116
  • [47] Approximating the minimum cycle mean
    Chatterjee, Krishnendu
    Henzinger, Monika
    Krinninger, Sebastian
    Loitzenbauer, Veronika
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (119): : 136 - 149
  • [48] APPROXIMATING THE MINIMUM EQUIVALENT DIGRAPH
    KHULLER, S
    RAGHAVACHARI, B
    YOUNG, N
    SIAM JOURNAL ON COMPUTING, 1995, 24 (04) : 859 - 872
  • [49] Independence number and minimum degree for path-factor critical uniform graphs
    Liu, Hongxia
    Pan, Xiaogang
    DISCRETE APPLIED MATHEMATICS, 2024, 359 : 153 - 158
  • [50] Approximating Minimum Reset Sequences
    Gerbush, Michael
    Heeringa, Brent
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2011, 6482 : 154 - +
12345