Robert Krauthgamer

Also published under:R. Krauthgamer

Affiliation

Dept. of Computer Science & Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel

Topic

Estimation Algorithm,Running Time,Original Graph,Planar Graphs,Polylogarithmic,Triangle Inequality,Unweighted Graph,Cardinality,Cut Edge,Cut Value,Edge Weights,Input Graph,Input String,Linear Time,Minimum Cut,Recursive Algorithm,Shortest Path,Simple Graph,Sparse Graph,Substring,Time Complexity,Time Graph,TimeTree,Undirected,Absolute Constant,Adaptive Sampling,Additional Error,Algorithm For Problem,All-pairs-shortest-path,Approximate Ratio,Block Length,Centroid,Closest Point,Clustering Problem,Colour Rings,Combinatorial Optimization Problem,Computational Biology,Constant Probability,Cost Function,Cost Path,Current Algorithms,Data Structure,Deterministic,Diagonal,Directed Graph,Dynamic Programming,Earth Mover’s Distance,Edge Connectivity,Edge Path,Edit Distance,

Biography

Robert Krauthgamer received his Ph.D. at the Weizmann Institute of Science in 2001 under Prof. Uriel Feige. He was subsequently a postdoc in Berkeley’s theory group, and then a Research Staff Member in the theory group at the IBM Almaden Research Center. Since 2007, he has been a faculty member at the Weizmann Institute of Science. Robert’s main research area is the design of algorithms for problems involving combinatorial optimization, finite metric spaces, high-dimensional geometry, data analysis, and related areas.