Login / Signup
Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems.
Dorit S. Hochbaum
Asaf Levin
Published in:
ACM Trans. Algorithms (2013)
Keyphrases
</>
approximation algorithms
order preserving
vertex cover
np hard
special case
np hardness
randomized algorithms
approximation schemes
minimum cost
approximation ratio
network design problem
objective function
search algorithm
worst case
greedy algorithms