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 条
  • [1] The minimum number of maximal independent sets in graphs with given order and independence number
    Tian, Yuting
    Tu, Jianhua
    DISCRETE APPLIED MATHEMATICS, 2025, 368 : 52 - 65
  • [2] Approximating the independence number via theϑ-function
    Noga Alon
    Nabil Kahale
    Mathematical Programming, 1998, 80 : 253 - 264
  • [3] Approximating the independence number via the θ-function
    Alon, Noga
    Kahale, Nabil
    Mathematical Programming, Series B, 1998, 80 (03): : 253 - 264
  • [4] Approximating the independence number via the θ-function
    Alon, N
    Kahale, N
    MATHEMATICAL PROGRAMMING, 1998, 80 (03) : 253 - 264
  • [5] THE MINIMUM INDEPENDENCE NUMBER FOR DESIGNS
    GRABLE, DA
    PHELPS, KT
    RODL, V
    COMBINATORICA, 1995, 15 (02) : 175 - 185
  • [6] Approximating Vizing's independence number conjecture
    Steffen, Eckhard
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2018, 71 : 153 - 160
  • [7] Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time
    Michael Krivelevich
    Van H. Vu
    Journal of Combinatorial Optimization, 2002, 6 : 143 - 155
  • [8] Approximating the independence number and the chromatic number in expected polynomial time
    Krivelevich, M
    Vu, VH
    AUTOMATA LANGUAGES AND PROGRAMMING, 2000, 1853 : 13 - 24
  • [9] Approximating the independence number and the chromatic number in expected polynomial time
    Krivelevich, M
    Vu, VH
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2002, 6 (02) : 143 - 155
  • [10] Bounding and approximating minimum maximal matchings in regular graphs
    Baste, Julien
    Fuerst, Maximilian
    Henning, Michael A.
    Mohr, Elena
    Rautenbach, Dieter
    DISCRETE MATHEMATICS, 2021, 344 (03)
12345