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 条
  • [21] A multiagent reinforcement learning algorithm to solve the maximum independent set problem
    Alipour, Mir Mohammad
    Abdolhosseinzadeh, Mohsen
    MULTIAGENT AND GRID SYSTEMS, 2020, 16 (01) : 101 - 115
  • [22] A Tutorial on Quantum Approximate Optimization Algorithm for Maximum Independent Set Problem
    Yang, Mingyu
    Gao, Fang
    Wu, Guojian
    Dai, Wei
    Shuang, Feng
    2021 PROCEEDINGS OF THE 40TH CHINESE CONTROL CONFERENCE (CCC), 2021, : 6317 - 6322
  • [23] Closed circle DNA algorithm of maximum weighted independent set problem
    Li, Qingyan
    Yin, Zhixiang
    Chen, Min
    Advances in Intelligent Systems and Computing, 2013, 212 : 113 - 121
  • [24] Algorithm for finding maximum independent set
    Olemskoy, I., V
    Firyulina, O. S.
    VESTNIK SANKT-PETERBURGSKOGO UNIVERSITETA SERIYA 10 PRIKLADNAYA MATEMATIKA INFORMATIKA PROTSESSY UPRAVLENIYA, 2014, 10 (01): : 79 - 89
  • [25] A NEW AND FAST APPROXIMATION ALGORITHM FOR VERTEX COVER USING A MAXIMUM INDEPENDENT SET (VCUMI)
    Khan, Imran
    Riaz, Naveed
    OPERATIONS RESEARCH AND DECISIONS, 2015, 25 (04) : 5 - 18
  • [26] AN O(20.304N) ALGORITHM FOR SOLVING MAXIMUM INDEPENDENT SET PROBLEM
    JIAN, T
    IEEE TRANSACTIONS ON COMPUTERS, 1986, 35 (09) : 847 - 851
  • [27] A New Distributed Learning Automata Based Algorithm for Maximum Independent Set Problem
    Khomami, Mohammad Mehdi Daliri
    Bagherpour, Negin
    Sajedi, Hedieh
    Meybodi, Mohammad Reza
    2016 ARTIFICIAL INTELLIGENCE AND ROBOTICS (IRANOPEN), 2016, : 12 - 17
  • [28] Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs
    Eto, Hiroshi
    Ito, Takehiro
    Liu, Zhilong
    Miyano, Eiji
    WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2017, 2017, 10167 : 228 - 240
  • [29] Approximation Schemes for Maximum Weight Independent Set of Rectangles
    Adamaszek, Anna
    Wiese, Andreas
    2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 400 - 409
  • [30] The maximum independent set problem in planar graphs
    Alekseev, Vladimir E.
    Lozin, Vadim
    Malyshev, Dmitriy
    Milanic, Martin
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS, 2008, 5162 : 96 - +
12345