Local approximations for maximum partial subgraph problem

被引：0
|
作者：
Monnot, J [1 ]
Paschos, VT [1 ]
Toulouse, S [1 ]
机构：
[1] Univ Paris 09, LAMSADE, F-75775 Paris 16, France
来源：
OPERATIONS RESEARCH LETTERS | 2004年 / 32卷 / 03期
关键词：
approximation algorithms; local search; APX-complete; maximum subgraph problem; minimum vertex deletion problem; hereditary property;
D O I：
10.1016/j.orl.2003.08.004
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We deal with MAX H-0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (delta(0) + 1)/(B + 2 + nu(0)), where B = max(nuis an element ofV)dG(nu), delta(0) = min(nuis an element ofV(H0))d(H0)(nu) and nu(0) = (\V(H-0)\ + 1)/delta(0). Next, we show that this ratio rises up to 3/(B + 1) when H-0 = K-3. Finally, we provide hardness results for MAX K-3-FREE PARTIAL SUBGRAPH. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码：217 / 224
页数：8
相关论文
共 50 条
  • [1] APPROXIMATIONS FOR THE MAXIMUM ACYCLIN SUBGRAPH PROBLEM
    HASSIN, R
    RUBINSTEIN, S
    INFORMATION PROCESSING LETTERS, 1994, 51 (03) : 133 - 140
  • [2] On the complexity of the maximum biplanar subgraph problem
    Yu, CW
    INFORMATION SCIENCES, 2000, 129 (1-4) : 239 - 250
  • [3] ON THE APPROXIMABILITY OF THE MAXIMUM COMMON SUBGRAPH PROBLEM
    KANN, V
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 377 - 388
  • [4] Maximum weight archipelago subgraph problem
    Hammer, Peter L.
    Majlender, Peter
    Simeone, Bruno
    Vizvari, Bela
    ANNALS OF OPERATIONS RESEARCH, 2014, 217 (01) : 253 - 262
  • [5] Maximum weight archipelago subgraph problem
    Peter L. Hammer
    Péter Majlender
    Bruno Simeone
    Béla Vizvári
    Annals of Operations Research, 2014, 217 : 253 - 262
  • [6] Heuristics for the maximum outerplanar subgraph problem
    Poranen, T
    JOURNAL OF HEURISTICS, 2005, 11 (01) : 59 - 88
  • [7] Heuristics for the Maximum Outerplanar Subgraph Problem
    Timo Poranen
    Journal of Heuristics, 2005, 11 : 59 - 88
  • [8] On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree
    Akutsu, Tatsuya
    Tamura, Takeyuki
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 146 - 155
  • [9] Subgraph extraction and metaheuristics for the maximum clique problem
    Duc-Cuong Dang
    Aziz Moukrim
    Journal of Heuristics, 2012, 18 : 767 - 794
  • [10] A polyhedral study of the maximum edge subgraph problem
    Bonomo, Flavia
    Marenco, Javier
    Saban, Daniela
    Stier-Moses, Nicolas E.
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (18) : 2573 - 2590
12345