Charikar, Moses - Department of Computer Science, Princeton University

• Vertex Sparsifiers and Abstract Rounding Algorithms Moses Charikar
• On the Impossibility of Dimension Reduction in # 1 Bo Brinkman # Moses Charikar +
• Improved Approximation for Directed Cut Problems Amit Agarwal
• A Tight Threshold for Metric Ramsey Phenomena Moses Charikar #
• Maximizing quadratic programs: extending Grothendieck's inequality
• Similarity Estimation Techniques from Rounding Moses S. Charikar
• Online Load Balancing for Related Machines 1 Piotr Berman
• MinWise Independent Permutations Andrei Z. Broder # Moses Charikar + Alan M. Frieze #
• Better Streaming Algorithms for Clustering Problems Moses Charikar #
• Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
• New Approximation Guarantee for Chromatic Number Sanjeev Arora #
• Clustering with Qualitative Information Moses Charikar #
• On targeting Markov segments Moses Charikar Ravi Kumar y Prabhakar Raghavan y Sridhar Rajagopalan y Andrew Tomkins y
• NearOptimal Algorithms for Unique Games [Extended Abstract]
• Approximating the Average Response Time in Broadcast Scheduling Nikhil Bansal
• Approximating the Smallest Grammar: Kolmogorov Complexity in Natural Models
• On Semide nite Programming Relaxations for Graph Coloring and Vertex Cover
• Greedy Approximation Algorithms for Finding Dense Components in a Graph
• Incremental Clustering and Dynamic Information Retrieval MOSES CHARIKAR # CHANDRA CHEKURI + TOMAS FEDER # RAJEEV MOTWANI
• Algorithms for Facility Location Problems with Outliers (Extended Abstract)
• On the Integrality Ratio for Asymmetric TSP Moses Charikar #
• Approximating a Finite Metric by a Small Number of Tree Metrics M. CHARIKAR \Lambda C. CHEKURI y A. GOEL z S. GUHA x S. PLOTKIN --
• A Derandomization Using MinWise Independent Permutations
• A constant-factor approximation algorithm for the k-median problem
• Clustering to Minimize the Sum of Cluster Diameters Moses Charikar #
• Resource Optimization in QoS Multicast Routing of RealTime Multimedia
• Sizing Sketches: A Rank-Based Analysis for Similarity Search
• Dimension Reduction in the # 1 norm Moses Charikar #
• On Page Migration and Other Relaxed Task Systems Yair Bartal Moses Charikar y Piotr Indyk z
• The Finite Capacity DialARide Problem MOSES CHARIKAR \Lambda
• Online Multicast with Egalitarian Cost Sharing Moses Charikar
• Query Strategies for Priced Information (Extended Abstract)
• R o u n d i n g v i a Tr e e s : D e t e r m i n i s t i c A p p r o x i m a t i o n A l g o r i th m s fo r G r o u p S t e i n e r Tr e e s an d km e d i a n
• Finding Frequent Items in Data Streams Moses Charikar #1 , Kevin Chen ##2 , and Martin FarachColton 3
• Constrained TSP and LowPower Computing Moses Charikar ?1 , Rajeev Motwani 1??1 , Prabhakar Raghavan ???2 , Craig Silverstein y1
• Every Permutation CSP of arity 3 is Approximation Resistant Moses Charikar
• MaxMin Allocation via Degree Lower-bounded Arborescences
• Algorithms for Capacitated Vehicle Routing MOSES CHARIKAR \Lambda
• Minimizing wirelength in zero and bounded skew clock trees \Lambda Moses Charikar y Jon Kleinberg z Ravi Kumar x Sridhar Rajagopalan z Amit Sahai --
• Combinatorial Feature Selection Problems Moses Charikar Venkatesan Guruswami y Ravi Kumar z Sridhar Rajagopalan x
• Detecting High Log-Densities an O(n1/4 ) Approximation for
• Improved Approximation Algorithms for Label Cover Problems
• Efficiently Matching Sets of Features with Random Histograms
• Asymmetric Distance Estimation with Sketches for Similarity Search in High-Dimensional Spaces
• Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems
• Local Global Tradeoffs in Metric Embeddings Moses Charikar
• Approximating minsum kClustering in Metric Spaces Yair Bartal
• Approximation Algorithms for Directed Steiner Problems Moses Charikar y
• A Divide and Conquer Algorithm for d-Dimensional Arrangement Moses Charikar