1. NP-hardness of euclidean sum-of-squares clustering;Aloise;Machine Learning,2009
2. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,1999
3. An implementation of logical analysis of data;Boros;IEEE Transactions on Knowledge and Data Engineering,2000
4. A faster algorithm for betweenness centrality;Brandes;Journal of Mathematical Sociology,2001
5. Branch-and-Bound Applications in Combinatorial Data Analysis;Brusco,2005