Fast local search for the maximum independent set problem

被引：0
|
作者：
Andrade, Diogo V. [2 ]
Resende, Mauricio G. C. [1 ]
Werneck, Renato F. [3 ]
机构：
[1] AT&T Labs Res, 180 Pk Ave, Florham Pk, NJ 07932 USA
[2] Google Inc, New York, NY 10011 USA
[3] Microsoft Res Silicon Valley, Mountain View, CA 94043 USA
来源：
EXPERIMENTAL ALGORITHMS, PROCEEDINGS | 2008年 / 5038卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Given a graph G = (V, E), the independent set problem is that of finding a maximum-cardinality subset S of V such that no two vertices in S are adjacent. We present a fast local search routine for this problem. Our algorithm can determine in linear time whether a maximal solution can be improved by replacing a single vertex with two others. We also show that an incremental version of this method can be useful within more elaborate heuristics. We test our algorithms on instances from the literature as well as on new ones proposed in this paper.
引用
收藏
页码：220 / +
页数：2
相关论文
共 50 条
  • [1] Fast local search for the maximum independent set problem
    Andrade, Diogo V.
    Resende, Mauricio G. C.
    Werneck, Renato F.
    [J]. JOURNAL OF HEURISTICS, 2012, 18 (04) : 525 - 547
  • [2] Fast local search for the maximum independent set problem
    Diogo V. Andrade
    Mauricio G. C. Resende
    Renato F. Werneck
    [J]. Journal of Heuristics, 2012, 18 : 525 - 547
  • [3] Accelerating Local Search for the Maximum Independent Set Problem
    Dahlum, Jakob
    Lamm, Sebastian
    Sanders, Peter
    Schulz, Christian
    Strash, Darren
    Werneck, Renato F.
    [J]. EXPERIMENTAL ALGORITHMS, SEA 2016, 2016, 9685 : 118 - 133
  • [4] A hybrid iterated local search heuristic for the maximum weight independent set problem
    Nogueira, Bruno
    Pinheiro, Rian G. S.
    Subramanian, Anand
    [J]. OPTIMIZATION LETTERS, 2018, 12 (03) : 567 - 583
  • [5] A hybrid iterated local search heuristic for the maximum weight independent set problem
    Bruno Nogueira
    Rian G. S. Pinheiro
    Anand Subramanian
    [J]. Optimization Letters, 2018, 12 : 567 - 583
  • [6] An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
    Haraguchi, Kazuya
    Hashimoto, Hideki
    Itoyanagi, Junji
    Yagiura, Mutsunori
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2019, 26 (04) : 1244 - 1268
  • [7] Iterated local search for the generalized independent set problem
    Nogueira, Bruno
    Pinheiro, Rian G. S.
    Tavares, Eduardo
    [J]. OPTIMIZATION LETTERS, 2021, 15 (04) : 1345 - 1369
  • [8] Iterated local search for the generalized independent set problem
    Bruno Nogueira
    Rian G. S. Pinheiro
    Eduardo Tavares
    [J]. Optimization Letters, 2021, 15 : 1345 - 1369
  • [9] Large Neighborhood Local Search for the Maximum Set Packing Problem
    Sviridenko, Maxim
    Ward, Justin
    [J]. AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 792 - 803
  • [10] Simple and fast surrogate constraint heuristics for the maximum independent set problem
    Alidaee, Bahram
    Kochenberger, Gary
    Wang, Haibo
    [J]. JOURNAL OF HEURISTICS, 2008, 14 (06) : 571 - 585
12345