Approximation Algorithms for Biclustering Problems.
Lusheng WangYu LinXiaowen LiuPublished in: SIAM J. Comput. (2008)
Keyphrases
- approximation algorithms
- vertex cover
- exact algorithms
- np hard
- np hardness
- approximation schemes
- special case
- randomized algorithms
- network design problem
- primal dual
- worst case
- precedence constraints
- polynomial time approximation
- facility location problem
- quadratic program
- branch and bound
- practical problems
- undirected graph
- optimization problems
- partial order
- greedy algorithm