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...

Celý popis

Podrobná bibliografia

Vydané v:	Acta informatica Ročník 62; číslo 1; s. 6
Hlavní autori:	Mahapatra, Sugyani, Narayanan, Manikandan, Narayanaswamy, N. S.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Heidelberg Springer Nature B.V 01.03.2025
Predmet:	Algorithms Apexes Approximation Evolutionary algorithms Graphical representations Hypercubes Minimum cost Parameterization Parameters Polynomials
ISSN:	0001-5903, 1432-0525
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!