Moses Charikar

From MaRDI portal
Person:634685

Available identifiers

zbMath Open charikar.moses-sDBLPc/MosesCharikarWikidataQ15835702 ScholiaQ15835702MaRDI QIDQ634685

List of research outcomes





PublicationDate of PublicationType
On-line load balancing for related machines2022-08-19Paper
Constrained TSP and low-power computing2022-08-19Paper
https://portal.mardi4nfdi.de/entity/Q50889432022-07-18Paper
Min-Cost Bipartite Perfect Matching with Delays2021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q50027052021-07-28Paper
https://portal.mardi4nfdi.de/entity/Q50027032021-07-28Paper
Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers2021-06-15Paper
The one-way communication complexity of dynamic time warping distance2021-03-17Paper
Efficient profile maximum likelihood for universal symmetric property estimation2020-01-30Paper
Hierarchical Clustering better than Average-Linkage2019-10-15Paper
Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach2019-06-20Paper
https://portal.mardi4nfdi.de/entity/Q57434072019-05-10Paper
Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics2018-07-16Paper
On Approximating Target Set Selection2018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q53687262017-10-10Paper
https://portal.mardi4nfdi.de/entity/Q53651422017-09-29Paper
Local guarantees in graph cuts and clustering2017-08-31Paper
Learning from untrusted data2017-08-17Paper
Multireference alignment using semidefinite programming2017-05-19Paper
Relax, No Need to Round2017-05-19Paper
A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)2016-09-29Paper
On targeting Markov segments2016-09-29Paper
Spectral embedding of \(k\)-cliques, graph partitioning and \(k\)-means2016-04-15Paper
Aggregating inconsistent information2015-11-11Paper
https://portal.mardi4nfdi.de/entity/Q55017812015-08-14Paper
Smoothed analysis of tensor decompositions2015-06-26Paper
Approximating min-sum k -clustering in metric spaces2015-02-27Paper
Clustering to minimize the sum of cluster diameters2015-02-27Paper
Integrality gaps for Sherali-Adams relaxations2015-02-04Paper
MaxMin allocation via degree lower-bounded arborescences2015-02-04Paper
https://portal.mardi4nfdi.de/entity/Q29345832014-12-18Paper
https://portal.mardi4nfdi.de/entity/Q29346362014-12-18Paper
Near-optimal algorithms for unique games2014-11-25Paper
Near-optimal algorithms for maximum constraint satisfaction problems2014-11-18Paper
Approximating the average response time in broadcast scheduling2014-10-13Paper
A tight threshold for metric Ramsey phenomena2014-10-13Paper
Query strategies for priced information (extended abstract)2014-09-26Paper
Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph2014-08-13Paper
A Dependent LP-Rounding Approach for the k-Median Problem2013-08-12Paper
On Quadratic Programming with a Ratio Objective2013-08-12Paper
Fitting Tree Metrics: Hierarchical Clustering and Phylogeny2012-02-11Paper
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant2011-10-18Paper
Improved approximation algorithms for label cover problems2011-08-16Paper
https://portal.mardi4nfdi.de/entity/Q30027732011-05-24Paper
Local Global Tradeoffs in Metric Embeddings2011-01-17Paper
A robust maximum completion time measure for scheduling2010-08-16Paper
Directed metrics and directed graph partitioning problems2010-08-16Paper
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems2010-08-16Paper
Aggregating inconsistent information2010-08-16Paper
Better streaming algorithms for clustering problems2010-08-16Paper
On non-uniform multicommodity buy-at-bulk network design2010-08-16Paper
Approximating the smallest grammar2010-08-05Paper
Similarity estimation techniques from rounding algorithms2010-08-05Paper
Improved Approximation Algorithms for Label Cover Problems2009-10-29Paper
Improved approximation for directed cut problems2009-01-05Paper
On the impossibility of dimension reduction in l 12008-12-21Paper
The Smallest Grammar Problem2008-12-21Paper
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem2008-05-27Paper
A derandomization using min-wise independent permutations2007-04-26Paper
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques2006-07-07Paper
Clustering with qualitative information2005-10-10Paper
Improved Combinatorial Algorithms for Facility Location Problems2005-09-16Paper
Minimizing Wirelength in Zero and Bounded Skew Clock Trees2005-02-28Paper
Incremental Clustering and Dynamic Information Retrieval2005-02-21Paper
https://portal.mardi4nfdi.de/entity/Q48289902004-11-29Paper
Clustering to minimize the sum of cluster diameters2004-11-22Paper
https://portal.mardi4nfdi.de/entity/Q47371792004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q45425282004-01-27Paper
A constant-factor approximation algorithm for the \(k\)-median problem2003-05-04Paper
Delayed information and action in on-line algorithms2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q45425512002-09-17Paper
Query strategies for priced information2002-09-12Paper
https://portal.mardi4nfdi.de/entity/Q45425532002-08-01Paper
Algorithms for capacitated vehicle routing2002-04-23Paper
On page migration and other relaxed task systems2002-03-03Paper
Algorithms for facility location problems with outliers. (Extended abstract)2002-01-30Paper
https://portal.mardi4nfdi.de/entity/Q45270302001-02-28Paper
On-Line Load Balancing for Related Machines2000-10-04Paper
Min-wise independent permutations2000-08-27Paper
https://portal.mardi4nfdi.de/entity/Q42502082000-06-21Paper
Approximation Algorithms for Directed Steiner Problems2000-05-28Paper
https://portal.mardi4nfdi.de/entity/Q42501821999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42522871999-06-17Paper

Research outcomes over time

This page was built for person: Moses Charikar