Parameterized algorithms for the Steiner arborescence problem on a hypercube

DOI10.1007/s00236-024-00474-8MaRDI QIDQ6659999

N. S. Narayanaswamy, Sugyani Mahapatra, Manikandan Narayanan

Publication date: 10 January 2025

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A series of approximation algorithms for the acyclic directed Steiner tree problem
• The computational complexity of inferring rooted phylogenies by parsimony
• The Steiner problem in phylogeny is NP-complete
• On the approximability of the Steiner tree problem in phylogeny
• Two variations of the minimum Steiner problem
• Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
• Additive Approximation for Near-Perfect Phylogeny Construction
• Polylogarithmic inapproximability
• Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
• Parameterized Algorithms
• The steiner problem in graphs
• Research in Computational Molecular Biology
• Research in Computational Molecular Biology
• Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices

This page was built for publication: Parameterized algorithms for the Steiner arborescence problem on a hypercube