NP-hardness of hypercube 2-segmentation
Computational Complexity
2014-11-05 v1
Abstract
The hypercube 2-segmentation problem is a certain biclustering problem that was previously claimed to be NP-hard, but for which there does not appear to be a publicly available proof of NP-hardness. This manuscript provides such a proof.
Cite
@article{arxiv.1411.0821,
title = {NP-hardness of hypercube 2-segmentation},
author = {Uriel Feige},
journal= {arXiv preprint arXiv:1411.0821},
year = {2014}
}