An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth - Archive ouverte HAL
Article Dans Une Revue Theoretical Computer Science Année : 2024

An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth

Résumé

In this paper, we introduce a problem called Minimum subTree problem with Degree Weights, or MTDW. This problem generalized covering tree problems like Spanning Tree, Steiner Tree, Minimum Branch Vertices, Minimum Leaf Spanning Tree, or Prize Collecting Steiner Tree.

Domaines

Informatique [cs]

Julien Baste  : Connectez-vous pour contacter le contributeur

https://hal.science/hal-04419217

Soumis le : vendredi 26 janvier 2024-11:48:28

Dernière modification le : mardi 17 septembre 2024-15:51:47

Fichier non déposé

Dates et versions

hal-04419217 , version 1 (26-01-2024)

Identifiants

Citer

Julien Baste, Dimitri Watel. An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. Theoretical Computer Science, 2024, 990, pp.114406. ⟨10.1016/j.tcs.2024.114406⟩. ⟨hal-04419217⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS TELECOM-SUDPARIS CRISTAL CRISTAL-ORKAD UNIV-LILLE IP_PARIS ENSIIE INSTITUT-MINES-TELECOM
137 Consultations
0 Téléchargements

Altmetric

Partager

More