Fixed-Parameter Algorithms for Unsplittable Flow Cover
Sign Up to like & getrecommendations! Published in 2021 at "Theory of Computing Systems"
DOI: 10.1007/s00224-021-10048-7
Abstract: The Unsplittable Flow Cover problem (UFP-cover) models the well-studied general caching problem and various natural resource allocation settings. We are given a path with a demand on each edge and a set of tasks, each… read more here.
Keywords: cover; problem; fixed parameter; unsplittable flow ... See more keywords
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees
Sign Up to like & getrecommendations! Published in 2022 at "Algorithmica"
DOI: 10.1007/s00453-021-00914-8
Abstract: We present the first fixed-parameter algorithm for constructing a tree-child phylogenetic network that displays an arbitrary number of binary input trees and has the minimum number of reticulations among all such networks. The algorithm uses… read more here.
Keywords: fixed parameter; tree child; parameter algorithm; constructing tree ... See more keywords
Improved Fixed-parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network.
Sign Up to like & getrecommendations! Published in 2021 at "IEEE/ACM transactions on computational biology and bioinformatics"
DOI: 10.1109/tcbb.2021.3111660
Abstract: Phylogenetic trees are unable to represent the evolutionary process for a collection of species if reticulation events happened, and a generalized model named phylogenetic network was introduced consequently. However, the representation of the evolutionary process… read more here.
Keywords: parameter algorithm; problem; fixed parameter; phylogenetic network ... See more keywords