An approximation hardness result for bipartite Clique

André Lanka Andreas Goerdt

Published in: Electron. Colloquium Comput. Complex. (2004)

Keyphrases

approximation algorithms
bipartite graph
real valued
data sets
real world
decision trees
np hard
information theoretic
constraint satisfaction
graph model