Skip to main content

Browsing by Author Charikar, Moses

Showing results 1 to 14 of 14
Publication DateArticle TitleAuthor(s)
2012A Dependent LP-Rounding Approach for the k-Median ProblemCharikar, Moses; Li, Shi
2015The Hardness of Approximation of Euclidean k-MeansAwasthi, Pranjal; Charikar, Moses; Krishnaswamy, Ravishankar; Sinop, Ali K
Aug-2017Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and BeyondLv, Qin; Josephson, William; Wang, Zhe; Charikar, Moses; Li, Kai
2019Multi-commodity Flow with In-Network ProcessingCharikar, Moses; Naamad, Yonatan; Rexford, Jenifer; Zou, X Kelvin
2014Multireference Alignment using Semidefinite ProgrammingBandeira, Afonso S; Charikar, Moses; Singer, Amit; Zhu, Andy
2016On Approximating Target Set SelectionCharikar, Moses; Naamad, Yonatan; Wirth, Anthony
2012On Quadratic Programming with a Ratio ObjectiveBhaskara, Aditya; Charikar, Moses; Manokaran, Rajsekar; Vijayaraghavan, Aravindan
2019The One-Way Communication Complexity of Dynamic Time Warping DistanceBraverman, Vladimir; Charikar, Moses; Kuszmaul, William; Woodruff, David P; Yang, Lin F
2014Online Bipartite Matching with Decomposable WeightsCharikar, Moses; Henzinger, Monika; Nguyễn, Huy L
2014Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold?Bhaskara, Aditya; Charikar, Moses; Moitra, Ankur; Vijayaraghavan, Aravindan
2012Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraphBhaskara, Aditya; Charikar, Moses; Guruswami, Venkatesan; Vijayaraghavan, Aravindan; Zhou, Yuan
Jan-2015Relax, no need to round: Integrality of clustering formulationsAwasthi, Pranjal; Bandeira, Afonso S; Charikar, Moses; Krishnaswamy, Ravishankar; Villar, Soledad; et al
May-2014Smoothed analysis of tensor decompositionsBhaskara, Aditya; Charikar, Moses; Moitra, Ankur; Vijayaraghavan, Aravindan
2014Uniqueness of Tensor Decompositions with Applications to Polynomial IdentifiabilityBhaskara, Aditya; Charikar, Moses; Vijayaraghavan, Aravindan
Showing results 1 to 14 of 14