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 条
  • [1] AN APPROXIMATION ALGORITHM FOR THE MAXIMUM INDEPENDENT SET PROBLEM ON PLANAR GRAPHS
    CHIBA, N
    NISHIZEKI, T
    SAITO, N
    SIAM JOURNAL ON COMPUTING, 1982, 11 (04) : 663 - 675
  • [2] AN APPROXIMATION ALGORITHM FOR THE MAXIMUM INDEPENDENT SET PROBLEM IN CUBIC PLANAR GRAPHS
    CHOUKHMANE, E
    FRANCO, J
    NETWORKS, 1986, 16 (04) : 349 - 356
  • [3] A New Distributed Approximation Algorithm for the Maximum Weight Independent Set Problem
    Du, Peng
    Zhang, Yuan
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2016, 2016
  • [4] A polytime preprocess algorithm for the maximum independent set problem
    Kroger, Samuel
    Validi, Hamidreza
    Hicks, Illya V.
    OPTIMIZATION LETTERS, 2024, 18 (02) : 651 - 661
  • [5] An elitist genetic algorithm for the maximum independent set problem
    Taranenko, A
    Vesel, A
    ITI 2001: PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES, 2001, : 373 - 378
  • [6] Solution to The Maximum Independent Set Problem with Genetic Algorithm
    Gencer, Mehmet
    Berberler, Murat Ersen
    2017 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ENGINEERING (UBMK), 2017, : 734 - 738
  • [7] A polytime preprocess algorithm for the maximum independent set problem
    Samuel Kroger
    Hamidreza Validi
    Illya V. Hicks
    Optimization Letters, 2024, 18 : 651 - 661
  • [8] A 3-Approximation Algorithm for Maximum Independent Set of Rectangles
    Galvez, Waldo
    Khan, Arindam
    Mari, Mathieu
    Momke, Tobias
    Pittu, Madhusudhan Reddy
    Wiese, Andreas
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 894 - 905
  • [9] An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
    Neuwohner, Meike
    38TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2021), 2021, 187
  • [10] Maximum Independent Set Approximation Based on Bellman-Ford Algorithm
    Dahshan, Mostafa H.
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2014, 39 (10) : 7003 - 7011
12345