- A POLYLOGARITHMIC APPROXIMATION OF THE MINIMUM URIEL FEIGE AND ROBERT KRAUTHGAMER
- The blackbox complexity of nearest neighbor search
- Networks on which hotpotato routing does not livelock \Lambda Uriel Feige and Robert Krauthgamer
- Asymmetric kCenter is log # nHard to Approximate Julia Chuzhoy # Sudipto Guha + Eran Halperin # Sanjeev Khanna
- Polylogarithmic Inapproximability # [Extended Abstract]
- A POLYLOGARITHMIC APPROXIMATION OF THE MINIMUM BISECTION #
- Improved Performance Guarantees for Bandwidth Minimization Heuristics
- On Triangulation of Simple Networks [Extended Abstract]
- Metric embeddings --beyond onedimensional distortion Robert Krauthgamer # Nathan Linial + Avner Magen #
- BIOINFORMATICS Vol. 1 no. 1 2003 Detecting protein sequence conservation via
- Constant Factor Approximation of VertexCuts in Planar Graphs
- Property testing of data dimensionality # Robert Krauthgamer + Ori Sasson #
- Measured descent: A new embedding method for finite metrics Robert Krauthgamer # James R. Lee + Manor Mendel # Assaf Naor
- On cutting a few vertices from a graph Uriel Feige Robert Krauthgamer Kobbi Nissim
- A Nonlinear Approach to Dimension Reduction Lee-Ad Gottlieb
- Metric embeddings beyond onedimensional distortion Robert Krauthgamer 1 Nathan Linial 2 Avner Magen 3
- The Smoothed Complexity of Edit Distance Alexandr Andoni
- Measured descent: A new embedding method for finite metrics Robert Krauthgamer
- Proximity algorithms for nearly-doubling spaces Lee-Ad Gottlieb and Robert Krauthgamer
- Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2011 Society for Industrial and Applied Mathematics
- The Smoothed Complexity of Edit Distance Alexandr Andoni1
- Metric Clustering via Consistent Labeling Robert Krauthgamer
- Earth Mover Distance over High-Dimensional Spaces Alexandr Andoni
- Earth Mover Distance over High-Dimensional Spaces Alexandr Andoni
- Pricing commodities Robert Krauthgamer
- Algorithms on negatively curved spaces [extended abstract]
- THEORY OF COMPUTING, Volume 2 (2006), pp. 207224 http://theoryofcomputing.org
- On the Hardness of Approximating Multicut and Sparsest-Cut Shuchi Chawla
- The black-box complexity of nearest neighbor search Robert Krauthgamer
- Navigating nets: Simple algorithms for proximity search [Extended Abstract]
- Constant Factor Approximation of Vertex-Cuts in Planar Graphs
- Polylogarithmic Inapproximability [Extended Abstract]
- Integrality ratio for Group Steiner Trees and Directed Steiner Trees Eran Halperin
- Discrete Applied Mathematics 127 (2003) 643 649 www.elsevier.com/locate/dam
- Integrality ratio for Group Steiner Trees and Directed Steiner Trees # Eran Halperin + Guy Kortsarz # Robert Krauthgamer Aravind Srinivasan
- Finite Metric Spaces -Combinatorics, Geometry and Algorithms Nathan Linial
- On the Hardness of Approximating Multicut and SparsestCut [Extended Abstract]
- The Sketching Complexity of Pattern Matching Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, and Ravi Kumar
- Integrality ratio for Group Steiner Trees and Directed Steiner Trees # Eran Halperin + Guy Kortsarz # Robert Krauthgamer # Aravind Srinivasan
- Estimating the Sortedness of a Data Stream Parikshit Gopalan
- The intrinsic dimensionality of graphs Robert Krauthgamer # James R. Lee +
- The Sketching Complexity of Pattern Matching Ziv BarYossef, T. S. Jayram, Robert Krauthgamer, and Ravi Kumar
- Object Location in Realistic Networks [Extended Abstract]
- Navigating nets: Simple algorithms for proximity search [Extended Abstract]
- Approximating Edit Distance Efficiently Ziv Bar-Yossef
- Approximating Sparsest Cut in Graphs of Bounded Treewidth
- The blackbox complexity of nearest neighbor search # Robert Krauthgamer + James R. Lee #
- Improved lower bounds for embeddings into L1 [Extended Abstract]
- Similarity searching, or how to find your neighbors efficiently
- Partitioning Graphs into Balanced Components Robert Krauthgamer
- Directed Spanners via Flow-Based Linear Programs Michael Dinitz
- Finding and certifying a large hidden clique in a semirandom graph \Lambda
- Bounded geometries, fractals, and lowdistortion embeddings Anupam Gupta # Robert Krauthgamer + James R. Lee #
- Vertex Sparsifiers: New Results from Old Techniques Matthias Englert1
- How hard is it to approximate the best Nash equilibrium? IBM Almaden
- Stereoscopic families of permutations, and their applications (Extended Abstract)
- The Intrinsic Dimensionality of Graphs Robert Krauthgamer #
- Hardness of approximation for vertexconnectivity networkdesign problems #
- A polylogarithmic approximation of the minimum bisection
- Hardness of approximation for vertexconnectivity network design problems
- Online Server Allocation in a Server Farm via Benefit Task Systems
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2009 Society for Industrial and Applied Mathematics
- The Computational Hardness of Estimating Edit Distance [Extended Abstract]
- Online Server Allocation in a Server Farm via Benefit Task Systems
- Pricing commodities, or How to sell when buyers have restricted valuations
- The intrinsic dimensionality of graphs Robert Krauthgamer
- The probable value of the LovaszSchrijver relaxations for maximum independent set #
- Finding and certifying a large hidden clique in a semirandom graph
- Fault-Tolerant Spanners: Better and Simpler Michael Dinitz
- Object Location in Realistic Networks [Extended Abstract]
- Stereoscopic families of permutations, and their applications (Extended Abstract)
- Approximate classification via earthmover metrics Aaron Archer # Jittat Fakcharoenphol + Chris Harrelson # Robert Krauthgamer
- Improved lower bounds for embeddings into L 1 [Extended Abstract]
- The probable value of the LovaszSchrijver relaxations for maximum independent set
- Tight lower bounds for the asymmetric kcenter problem Eran Halperin # Guy Kortsarz + Robert Krauthgamer #
- A polylogarithmic approximation of the minimum (Extended Abstract) \Lambda
- Greedy List Intersection Robert Krauthgamer #
- Asymmetric k-Center is log n-Hard to Approximate
- The probable value of the Lovasz-Schrijver relaxations for maximum independent set
- Approximating the minimum bisection size (Extended Abstract) \Lambda
- Coping with NP-hardness: Approximating minimum bisection
- On the Hardness of Approximating Multicut and SparsestCut # Shuchi Chawla + Robert Krauthgamer # Ravi Kumar Yuval Rabani
- Simple Algorithms for HotPotato Routing
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2010 Society for Industrial and Applied Mathematics
- Private Approximation of NPhard Functions [Extended Abstract]
- Streaming Algorithms via Precision Sampling Alexandr Andoni
- Min-Max Graph Partitioning and Small Set Expansion Nikhil Bansal
