Approximation Algorithms for the Selection of Robust Tag SNPs.
Yao-Ting HuangKui ZhangTing ChenKun-Mao ChaoPublished in: WABI (2004)
Keyphrases
- approximation algorithms
- special case
- np hard
- vertex cover
- minimum cost
- facility location problem
- worst case
- primal dual
- np hardness
- set cover
- network design problem
- open shop
- randomized algorithms
- constant factor
- exact algorithms
- approximation ratio
- undirected graph
- approximation schemes
- disjoint paths
- lower bound
- combinatorial auctions
- scheduling problem