Sciweavers

138 search results - page 1 / 28
» Algorithms for induced biclique optimization problems
Sort
View
COLOGNETWENTE
2010
13 years 7 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
14 years 5 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
ICALP
2011
Springer
13 years 2 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
GECCO
2004
Springer
14 years 4 months ago
Inducing Sequentiality Using Grammatical Genetic Codes
Abstract. This paper studies the inducement of sequentiality in genetic algorithms (GAs) for uniformly-scaled problems. Sequentiality is a phenomenon in which sub-solutions converg...
Kei Ohnishi, Kumara Sastry, Ying-Ping Chen, David ...