ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1408.4045
  4. Cited By
Relax, no need to round: integrality of clustering formulations

Relax, no need to round: integrality of clustering formulations

18 August 2014
Pranjal Awasthi
Afonso S. Bandeira
Moses Charikar
Ravishankar Krishnaswamy
Soledad Villar
Rachel A. Ward
ArXivPDFHTML

Papers citing "Relax, no need to round: integrality of clustering formulations"

16 / 16 papers shown
Title
On the Exactness of SDP Relaxation for Quadratic Assignment Problem
On the Exactness of SDP Relaxation for Quadratic Assignment Problem
Shuyang Ling
38
4
0
12 Aug 2024
Semidefinite programming on population clustering: a global analysis
Semidefinite programming on population clustering: a global analysis
Shuheng Zhou
18
1
0
01 Jan 2023
Global Optimization for Cardinality-constrained Minimum Sum-of-Squares
  Clustering via Semidefinite Programming
Global Optimization for Cardinality-constrained Minimum Sum-of-Squares Clustering via Semidefinite Programming
V. Piccialli
A. M. Sudoso
18
3
0
19 Sep 2022
Strong recovery of geometric planted matchings
Strong recovery of geometric planted matchings
Dmitriy Kunisky
Jonathan Niles-Weed
29
24
0
12 Jul 2021
Spectral Methods for Data Science: A Statistical Perspective
Spectral Methods for Data Science: A Statistical Perspective
Yuxin Chen
Yuejie Chi
Jianqing Fan
Cong Ma
40
165
0
15 Dec 2020
Flow-based Algorithms for Improving Clusters: A Unifying Framework,
  Software, and Performance
Flow-based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
K. Fountoulakis
M. Liu
D. Gleich
Michael W. Mahoney
21
10
0
20 Apr 2020
Big-Data Clustering: K-Means or K-Indicators?
Big-Data Clustering: K-Means or K-Indicators?
Feiyu Chen
Yuchen Yang
Liwei Xu
Taiping Zhang
Yin Zhang
16
4
0
03 Jun 2019
Learning by Unsupervised Nonlinear Diffusion
Learning by Unsupervised Nonlinear Diffusion
Mauro Maggioni
James M. Murphy
DiffM
30
40
0
15 Oct 2018
Weighted total variation based convex clustering
Weighted total variation based convex clustering
Guodong Xu
Yu Xia
Hui Ji
67
4
0
28 Aug 2018
An Efficient Semismooth Newton Based Algorithm for Convex Clustering
An Efficient Semismooth Newton Based Algorithm for Convex Clustering
Yancheng Yuan
Defeng Sun
Kim-Chuan Toh
15
28
0
20 Feb 2018
When Do Birds of a Feather Flock Together? k-Means, Proximity, and Conic
  Programming
When Do Birds of a Feather Flock Together? k-Means, Proximity, and Conic Programming
Xiaodong Li
Yang Li
Shuyang Ling
Thomas Strohmer
Ke Wei
27
36
0
16 Oct 2017
Hierarchical Clustering via Spreading Metrics
Hierarchical Clustering via Spreading Metrics
Aurko Roy
Sebastian Pokutta
30
73
0
28 Oct 2016
Fast Multiplier Methods to Optimize Non-exhaustive, Overlapping
  Clustering
Fast Multiplier Methods to Optimize Non-exhaustive, Overlapping Clustering
Yangyang Hou
Joyce Jiyoung Whang
D. Gleich
Inderjit S. Dhillon
16
5
0
05 Feb 2016
$k$-center Clustering under Perturbation Resilience
kkk-center Clustering under Perturbation Resilience
Maria-Florina Balcan
Nika Haghtalab
Colin White
OOD
28
49
0
14 May 2015
Dissimilarity-based Sparse Subset Selection
Dissimilarity-based Sparse Subset Selection
Member Ieee Ehsan Elhamifar
Fellow Ieee Guillermo Sapiro
F. I. S. Shankar Sastry
49
125
0
25 Jul 2014
Improved Graph Clustering
Improved Graph Clustering
Yudong Chen
Sujay Sanghavi
Huan Xu
94
191
0
11 Oct 2012
1