Publication:5417661
From MaRDI portal
zbMath1288.68197MaRDI QIDQ5417661
Publication date: 22 May 2014
68Q25: Analysis of algorithms and problem complexity
90C22: Semidefinite programming
68T05: Learning and adaptive systems in artificial intelligence
68R10: Graph theory (including graph drawing) in computer science
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Exact Clustering of Weighted Graphs via Semidefinite Programming, A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints, An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity, Concentration and Moment Inequalities for Polynomials of Independent Random Variables, Correlation clustering and two-edge-connected augmentation for planar graphs, Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem, Convex optimization for the densest subgraph and densest submatrix problems, Guaranteed clustering and biclustering via semidefinite programming, On semidefinite relaxations for the block model, Convex relaxation methods for community detection, Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs, A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis, An improved approximation algorithm for capacitated correlation clustering problem, Approximation algorithm for min-max correlation clustering problem with outliers, Approximation algorithms for two variants of correlation clustering problem, Learning representations from dendrograms, Robust and computationally feasible community detection in the presence of arbitrary outlier nodes, Approximation algorithms for the lower bounded correlation clustering problem, Clustering with Local Restrictions
