A (DELTA/2)-APPROXIMATION ALGORITHM FOR THE MAXIMUM INDEPENDENT SET PROBLEM

被引：12
|
作者：
PASCHOS, VT
机构：
[1] UNIV PARIS 11,LRI,F-91405 ORSAY,FRANCE
[2] UNIV PARIS 01,CERMSEM,F-75005 PARIS,FRANCE
来源：
INFORMATION PROCESSING LETTERS | 1992年 / 44卷 / 01期
关键词：
APPROXIMATION ALGORITHMS; ANALYSIS OF ALGORITHMS; COMBINATORIAL PROBLEMS; INDEPENDENT SET; COMPUTATIONAL COMPLEXITY;
D O I：
10.1016/0020-0190(92)90248-T
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We show how we can improve the approximation ratio for the independent set problem on a graph. We obtain thus an approximation ratio asymptotically equal to DELTA /2, in place of DELTA - 1, where DELTA is the maximum degree of the graph.
引用
收藏
页码：11 / 13
页数：3
相关论文
共 50 条
  • [41] Automatic generation of a hybrid algorithm for the maximum independent set problem using genetic programming
    Silva-Munoz, Moises
    Contreras-Bolton, Carlos
    Rey, Carlos
    Parada, Victor
    APPLIED SOFT COMPUTING, 2023, 144
  • [42] An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
    Haraguchi, Kazuya
    Hashimoto, Hideki
    Itoyanagi, Junji
    Yagiura, Mutsunori
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2019, 26 (04) : 1244 - 1268
  • [43] O(20.304N ) ALGORITHM FOR SOLVING MAXIMUM INDEPENDENT SET PROBLEM.
    Jian, Tang
    IEEE Transactions on Computers, 1986, C-35 (09) : 847 - 851
  • [44] A new simple algorithm for the maximum-weight independent set problem on circle graphs
    Valiente, G
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, 2906 : 129 - 137
  • [45] Algorithm of Solving the Maximum Edges Independent Set Problem Based on DNA Molecules Computation
    Wang, Zhaocai
    Huang, Wei
    Ye, Chaorong
    Zhang, Yiming
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2014, 11 (04) : 961 - 963
  • [46] An approximation algorithm for the maximum traveling salesman problem
    Dept. of Stat. and Operations Res., School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel
    Inf. Process. Lett., 3 (125-130):
  • [47] An approximation algorithm for the maximum spectral subgraph problem
    Bazgan, Cristina
    Beaujean, Paul
    Gourdin, Eric
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (03) : 1880 - 1899
  • [48] An approximation algorithm for the maximum traveling salesman problem
    Hassin, R
    Rubinstein, S
    INFORMATION PROCESSING LETTERS, 1998, 67 (03) : 125 - 130
  • [49] An approximation algorithm for the maximum spectral subgraph problem
    Cristina Bazgan
    Paul Beaujean
    Éric Gourdin
    Journal of Combinatorial Optimization, 2022, 44 : 1880 - 1899
  • [50] Approximation algorithms for maximum independent set of a unit disk graph
    Das, Gautam K.
    De, Minati
    Kolay, Sudeshna
    Nandy, Subhas C.
    Sur-Kolay, Susmita
    INFORMATION PROCESSING LETTERS, 2015, 115 (03) : 439 - 446
12345