Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks.
Jaroslaw ByrkaPawel GawrychowskiKatharina T. HuberSteven KelkPublished in: J. Discrete Algorithms (2010)
Keyphrases
- approximation algorithms
- worst case
- np hard
- constant factor
- minimum cost
- vertex cover
- average case
- greedy algorithm
- upper bound
- facility location problem
- lower bound
- error bounds
- network design problem
- primal dual
- randomized algorithms
- set cover
- precedence constraints
- approximation ratio
- approximation schemes
- open shop
- combinatorial auctions
- special case
- computational complexity
- disjoint paths
- undirected graph
- strongly np hard
- learning algorithm
- branch and bound algorithm
- partial order
- optimal solution