Maximum weight archipelago subgraph problem

Peter L. Hammer

doi:10.1007/s10479-013-1518-x

Maximum weight archipelago subgraph problem

2014-02-15

0

PRE

AI

DOI：10.1007/s10479-013-1518-x

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Set covering problem

Maximum weight archipelago subgraph problem

Dow Jones index

Maximum weight archipelago subgraph problem

Abstract

Journal

Organization