History of ClassW04ApproxAlgs/QiaofengYang

Difference (from prior major revision) (author diff)

Changed: 137c137

It is well known that Maximum Clique is hard to approximate within n^1-ε. The hardness results for Biclique are still unknown. In this tutorial, we showed that biclique can be reduced to clique. Are these two problems of the same hardness? That is, can clique be reduced to biclique? It's still an open question.

It is well known that Maximum Clique is hard to approximate within n^1-ε. The hardness results for Maximum Edge Biclique are still unknown. In this tutorial, we showed that biclique can be reduced to clique. Are these two problems of the same hardness? That is, can clique be reduced to biclique? It's still an open question.

	Revision 175 . . March 19, 2004 4:50 pm by c64.cs.ucr.edu
	Revision 174 . . March 19, 2004 4:44 pm by c64.cs.ucr.edu
	Revision 81 . . March 18, 2004 12:30 am by alglab1.cs.ucr.edu