Maximum weight archipelago subgraph problem

被引：0

作者：

Hammer, Peter L. ^{[1
]}

Majlender, Peter ^{[2
]}

Simeone, Bruno ^{[3
]}

Vizvari, Bela ^{[4
]}

机构：

[1] Rutgers State Univ, RUTCOR, Piscataway, NJ USA

[2] Stockholm Univ, Dept Comp & Syst Sci, S-10691 Stockholm, Sweden

[3] Univ Roma La Sapienza, I-00185 Rome, Italy

[4] Eastern Mediterranean Univ, Dept Ind Engn, Gazimagusa, Cyprus

来源：

ANNALS OF OPERATIONS RESEARCH | 2014年 / 217卷 / 01期

关键词：

Set covering problem; Maximum weight archipelago subgraph problem; Dow Jones index;

D O I：

10.1007/s10479-013-1518-x

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper is devoted to a new problem of combinatorial optimization. The problem is called Maximum Weight Archipelago Subgraph Problem (MWASP). Archipelago is a signed graph such that the negative edges connect the components of the graph of the positive edges. The new problem is to find a subset of edges in a weighted signed graph such that (i) if the edges of the subset are deleted from the graph then the remaining graph is an archipelago; and (ii) the subset has minimal total weight among the subsets having property (i). The problem is NP-complete, however a polynomial algorithm is provided to obtain the maximal weight of an edge what is still necessary to delete. The problem MWAP is used to analyze the relation of the blue chips of the Dow Jones Index.

引用

页码：253 / 262

页数：10

共 50 条

[41] Approximating the maximum common subgraph isomorphism problem with a weighted graph
Chen, Alan Chia-Lung
Elhajj, Ahmed
Gao, Shang
Sarhan, Abdullah
Afra, Salim
Kassem, Ahmad
Alhajj, Reda
KNOWLEDGE-BASED SYSTEMS, 2015, 85 : 265 - 276
[42] Approximating the maximum 3-edge-colorable subgraph problem
Rizzi, Romeo
DISCRETE MATHEMATICS, 2009, 309 (12) : 4166 - 4170
[43] Online algorithms for the maximum k-colorable subgraph problem
Hertz, Alain
Montagne, Romain
Gagnon, Francois
COMPUTERS & OPERATIONS RESEARCH, 2018, 91 : 209 - 224
[44] Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem
Bazgan, Cristina
Beaujean, Paul
Gourdin, Eric
COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2018), 2018, 11346 : 108 - 122
[45] A linear programming formulation for the maximum complete multipartite subgraph problem
Cornaz, D
MATHEMATICAL PROGRAMMING, 2006, 105 (2-3) : 329 - 344
[46] Two new approximation algorithms for the maximum planar subgraph problem
Department of Computer Sciences, University of Tampere, P.O. Box 607, FIN-33014, Tampere, Finland
Acta Cybern, 2008, 3 (503-527):
[47] Two New Approximation Algorithms for the Maximum Planar Subgraph Problem
Poranen, Timo
ACTA CYBERNETICA, 2008, 18 (03): : 503 - 527
[48] THE PARALLEL COMPLEXITY OF APPROXIMATION ALGORITHMS FOR THE MAXIMUM ACYCLIC SUBGRAPH PROBLEM
GREENLAW, R
MATHEMATICAL SYSTEMS THEORY, 1992, 25 (03): : 161 - 175
[49] Maximum balanced subgraph problem parameterized above lower bound
Crowston, R.
Gutin, G.
Jones, M.
Muciaccia, G.
THEORETICAL COMPUTER SCIENCE, 2013, 513 : 53 - 64
[50] THE MAXIMUM K-COLORABLE SUBGRAPH PROBLEM FOR CHORDAL GRAPHS
YANNAKAKIS, M
GAVRIL, F
INFORMATION PROCESSING LETTERS, 1987, 24 (02) : 133 - 137

← 1 2 3 4 5 →