The maximum weight spanning star forest problem : polyhedral and algorithmic results on trees and cycles - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

The maximum weight spanning star forest problem : polyhedral and algorithmic results on trees and cycles

Viet Hung Nguyen

Résumé

A star is a graph in which some vertex is incident with every edge of the graph, i.e. a graph of diameter at most 2.
A star forest is a graph in which each connected component is a star.
 Given a connected graph $G$ in which
the edges may be weighted positively. A spanning star forest
of $G$ is a subgraph of $G$ which is a star forest spanning the vertices of $G$. The size of a spanning star forest
$F$ of $G$ is defined to be the number of edges of $F$ if $G$ is unweighted and the total weight of all edges of $F$ if
$G$ is weighted. We are interested in the problem of finding a Maximum Weight spanning Star Forest (MWSFP) in $G$. In \cite{CTNguyen}, the authors introduced the MWSFP and
proved its NP-hardness. They also gave a polynomial time algorithm for the MWSF problem when $G$ is a tree.\\
 In this paper, we present a polyhedral investigation of the maximal weight spanning star forest problem. In particular, we define two new classes of facet-defining inequalities that
 give complete linear programming formulations of the problem when $G$ is either a tree or a cycle. We also give a polynomial time combinatorial algorithm that solves the
 MSWF problem when $G$ is a cycle.

Fichier non déposé

Dates et versions

hal-00946295 , version 1 (13-02-2014)

Identifiants

  • HAL Id : hal-00946295 , version 1

Citer

Viet Hung Nguyen. The maximum weight spanning star forest problem : polyhedral and algorithmic results on trees and cycles. ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Société française de recherche opérationnelle et d'aide à la décision, Feb 2014, Bordeaux, France. ⟨hal-00946295⟩
230 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More