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 条

[21] On the maximum acyclic subgraph problem under disjunctive constraints
Santana Mapa, Silvia Maria
Urrutia, Sebastian
INFORMATION PROCESSING LETTERS, 2015, 115 (02) : 119 - 124
[22] Polyhedral study of the maximum common induced subgraph problem
Breno Piva
Cid Carvalho de Souza
Annals of Operations Research, 2012, 199 : 77 - 102
[23] SUBGRAPH EXTRACTION AND MEMETIC ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM
Duc-Cuong Dang
Moukrim, Aziz
ICEC 2010: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION, 2010, : 77 - 84
[24] A simulated annealing algorithm for the maximum planar subgraph problem
Poranen, T
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2004, 81 (05) : 555 - 568
[25] Exact Algorithm for the Maximum Induced Planar Subgraph Problem
Fomin, Fedor V.
Todinca, Ioan
Villanger, Yngve
ALGORITHMS - ESA 2011, 2011, 6942 : 287 - 298
[26] A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem
Minot, Mael
Ndiaye, Samba Ndojh
Solnon, Christine
2015 IEEE 27TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2015), 2015, : 461 - 468
[27] The maximum k-colorable subgraph problem and orbitopes
Januschowski, Tim
Pfetsch, Marc E.
DISCRETE OPTIMIZATION, 2011, 8 (03) : 478 - 494
[28] Polyhedral study of the maximum common induced subgraph problem
Piva, Breno
de Souza, Cid Carvalho
ANNALS OF OPERATIONS RESEARCH, 2012, 199 (01) : 77 - 102
[29] The maximum common edge subgraph problem: A polyhedral investigation
Bahiense, Laura
Manic, Gordana
Piva, Breno
de Souza, Cid C.
DISCRETE APPLIED MATHEMATICS, 2012, 160 (18) : 2523 - 2541
[30] The maximum induced bipartite subgraph problem with edge weights
Cornaz, Denis
Mahjoub, A. Ridha
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (03) : 662 - 675

← 1 2 3 4 5 →