Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms.
Giuseppe LanciaMaria Cristina PinottiRomeo RizziPublished in: INFORMS J. Comput. (2004)
Keyphrases
- approximation algorithms
- worst case
- np hardness
- np hard
- special case
- minimum cost
- vertex cover
- facility location problem
- network design problem
- set cover
- open shop
- upper bound
- primal dual
- exact algorithms
- constant factor approximation
- computational complexity
- approximation ratio
- constant factor
- randomized algorithms
- approximation schemes
- error bounds
- undirected graph
- greedy algorithm
- disjoint paths
- search space