On Bipartite and Multipartite Clique Problems

Ahuja, 1993 Alon, 1992 B. Ganter, personal communication. Ganter, 1996 Garey, 1979 Hardy, 1954 Hochbaum, 1997, Approximating clique and biclique problems, J. Algorithms, 29, 174, 10.1006/jagm.1998.0964 S. Krolak-Schwerdt, and, P. Orlik, Ein Verfahren zur Klassifikation zweimodaler bin arer Daten (A method for classifying twomodal binary data), presented at the Annual Conference of the German Classication Society, 1996. Nemhauser, 1988 R. Peeters, The Maximum Edge Biclique Problem Is NP-Complete, Tilburg University Department of Econometrics research memorandum, 2000. Swaminathan, 1998, Management of broader product lines through delayed product differentiation using vanilla boxes, Management Sci., 44, 161, 10.1287/mnsc.44.12.S161