The following pages link to (Q5417661):
Displayed 19 items.
- Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
- Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← links)
- On semidefinite relaxations for the block model (Q1747735) (← links)
- Convex relaxation methods for community detection (Q2038282) (← links)
- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs (Q2039649) (← links)
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis (Q2079285) (← links)
- An improved approximation algorithm for capacitated correlation clustering problem (Q2149853) (← links)
- Approximation algorithm for min-max correlation clustering problem with outliers (Q2150588) (← links)
- Approximation algorithms for two variants of correlation clustering problem (Q2156281) (← links)
- Learning representations from dendrograms (Q2217438) (← links)
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes (Q2352734) (← links)
- Approximation algorithms for the lower bounded correlation clustering problem (Q2677653) (← links)
- Clustering with Local Restrictions (Q3012850) (← links)
- Exact Clustering of Weighted Graphs via Semidefinite Programming (Q4633040) (← links)
- A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints (Q5152474) (← links)
- An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity (Q5162656) (← links)
- Concentration and Moment Inequalities for Polynomials of Independent Random Variables (Q5743410) (← links)
- Correlation clustering and two-edge-connected augmentation for planar graphs (Q6046943) (← links)
- Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem (Q6053495) (← links)