scientific article; zbMATH DE number 6297741
From MaRDI portal
Publication:5417661
zbMath1288.68197MaRDI QIDQ5417661
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (19)
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 ⋮ Correlation clustering and two-edge-connected augmentation for planar graphs ⋮ Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem ⋮ Approximation algorithms for the lower bounded correlation clustering problem ⋮ Learning representations from dendrograms ⋮ Guaranteed clustering and biclustering via semidefinite programming ⋮ A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints ⋮ Clustering with Local Restrictions ⋮ On semidefinite relaxations for the block model ⋮ An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity ⋮ Convex relaxation methods for community detection ⋮ Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs ⋮ Convex optimization for the densest subgraph and densest submatrix problems ⋮ Exact Clustering of Weighted Graphs via Semidefinite Programming ⋮ Concentration and Moment Inequalities for Polynomials of Independent Random Variables ⋮ A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis ⋮ Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
This page was built for publication:
