Parameterized algorithms for the Steiner arborescence problem on a hypercube

Motivated by a phylogeny reconstruction problem in evolutionary biology, we study the minimum Steiner arborescence problem on directed hypercubes (MSA-DH). Given m, representing the directed hypercube Q→m, and a set of terminals R, the problem asks to find a Steiner arborescence that spans R with mi...

Full description

Bibliographic Details

Published in:	Acta informatica Vol. 62; no. 1; p. 6
Main Authors:	Mahapatra, Sugyani, Narayanan, Manikandan, Narayanaswamy, N. S.
Format:	Journal Article
Language:	English
Published:	Heidelberg Springer Nature B.V 01.03.2025
Subjects:	Algorithms Apexes Approximation Evolutionary algorithms Graphical representations Hypercubes Minimum cost Parameterization Parameters Polynomials
ISSN:	0001-5903, 1432-0525
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!