The following pages link to Moses Charikar (Q634685):
Displaying 50 items.
- (Q236649) (redirect page) (← links)
- Improved approximation algorithms for label cover problems (Q634686) (← links)
- Query strategies for priced information (Q696973) (← links)
- A derandomization using min-wise independent permutations (Q876688) (← links)
- Min-wise independent permutations (Q1577016) (← links)
- Delayed information and action in on-line algorithms (Q1854463) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
- Clustering to minimize the sum of cluster diameters (Q1887718) (← links)
- Local guarantees in graph cuts and clustering (Q2401152) (← links)
- Clustering with qualitative information (Q2568462) (← links)
- (Q2753729) (← links)
- (Q2768359) (← links)
- Algorithms for Capacitated Vehicle Routing (Q2784475) (← links)
- Spectral Embedding of k-Cliques, Graph Partitioning and k-Means (Q2800578) (← links)
- A constant-factor approximation algorithm for the <i>k</i> -median problem (extended abstract) (Q2819529) (← links)
- On targeting Markov segments (Q2819538) (← links)
- On Quadratic Programming with a Ratio Objective (Q2843240) (← links)
- A Dependent LP-Rounding Approach for the k-Median Problem (Q2843247) (← links)
- Detecting high log-densities (Q2875146) (← links)
- (Q2921662) (← links)
- (Q2921673) (← links)
- Near-optimal algorithms for maximum constraint satisfaction problems (Q2930257) (← links)
- Near-optimal algorithms for unique games (Q2931385) (← links)
- (Q2934583) (← links)
- (Q2934636) (← links)
- Multireference alignment using semidefinite programming (Q2988900) (← links)
- Relax, No Need to Round (Q2989030) (← links)
- (Q3002773) (← links)
- Local Global Tradeoffs in Metric Embeddings (Q3068641) (← links)
- Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant (Q3093627) (← links)
- Fitting Tree Metrics: Hierarchical Clustering and Phylogeny (Q3115867) (← links)
- Query strategies for priced information (extended abstract) (Q3192028) (← links)
- On the impossibility of dimension reduction in l <sub>1</sub> (Q3546289) (← links)
- The Smallest Grammar Problem (Q3546682) (← links)
- Improved approximation for directed cut problems (Q3549668) (← links)
- Approximating the smallest grammar (Q3579221) (← links)
- Similarity estimation techniques from rounding algorithms (Q3579235) (← links)
- Better streaming algorithms for clustering problems (Q3581265) (← links)
- On non-uniform multicommodity buy-at-bulk network design (Q3581390) (← links)
- O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems (Q3581406) (← links)
- A robust maximum completion time measure for scheduling (Q3581492) (← links)
- Directed metrics and directed graph partitioning problems (Q3581572) (← links)
- Improved Approximation Algorithms for Label Cover Problems (Q3639232) (← links)
- (Q4250182) (← links)
- (Q4250208) (← links)
- (Q4252287) (← links)
- (Q4527030) (← links)
- (Q4542528) (← links)
- (Q4542551) (← links)
- (Q4542553) (← links)
