The following pages link to Robert Krauthgamer (Q249078):
Displaying 50 items.
- Pricing commodities (Q627117) (← links)
- Metric embeddings -- beyond one-dimensional distortion (Q701786) (← links)
- A nonlinear approach to dimension reduction (Q894683) (← links)
- Metric decompositions of path-separable graphs (Q1679219) (← links)
- On cutting a few vertices from a graph (Q1811082) (← links)
- Almost-smooth histograms and sliding-window graph algorithms (Q2088588) (← links)
- Faster algorithms for orienteering and \(k\)-TSP (Q2124233) (← links)
- Do semidefinite relaxations solve sparse PCA up to the information limit? (Q2352742) (← links)
- On the hardness of approximating Multicut and Sparsest-Cut (Q2458939) (← links)
- Measured descent: A new embedding method for finite metrics (Q2571745) (← links)
- The black-box complexity of nearest-neighbor search (Q2581270) (← links)
- Smoothness of Schatten norms and sliding-window matrix streams (Q2671801) (← links)
- On Approximating the Achromatic Number (Q2753533) (← links)
- (Q2768311) (← links)
- A Polylogarithmic Approximation of the Minimum Bisection (Q2784494) (← links)
- On Sketching Quadratic Forms (Q2800579) (← links)
- The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme (Q2817793) (← links)
- Preserving Terminal Distances Using Minors (Q2843284) (← links)
- Adaptive Metric Dimensionality Reduction (Q2859224) (← links)
- (Q2934610) (← links)
- Sketching and Embedding are Equivalent for Norms (Q2941540) (← links)
- Fault-tolerant spanners (Q2943394) (← links)
- Efficient Classification for Metric Data (Q2986185) (← links)
- Sketching Cuts in Graphs and Hypergraphs (Q2989051) (← links)
- How Hard Is It to Approximate the Best Nash Equilibrium? (Q2999855) (← links)
- (Q3002773) (← links)
- (Q3002830) (← links)
- The Computational Hardness of Estimating Edit Distance (Q3068638) (← links)
- Tight Bounds for Gomory-Hu-like Cut Counting (Q3181053) (← links)
- The smoothed complexity of edit distance (Q3189087) (← links)
- Approximating the minimum bisection size (extended abstract) (Q3192022) (← links)
- The Smoothed Complexity of Edit Distance (Q3521932) (← links)
- Asymmetric <i>k</i> -center is log <sup>*</sup> <i>n</i> -hard to approximate (Q3546291) (← links)
- (Q3579398) (← links)
- (Q3579410) (← links)
- Polylogarithmic inapproximability (Q3581278) (← links)
- Improved lower bounds for embeddings into <i>L</i><sub>1</sub> (Q3583421) (← links)
- Approximating Sparsest Cut in Graphs of Bounded Treewidth (Q3588403) (← links)
- Proximity Algorithms for Nearly-Doubling Spaces (Q3588407) (← links)
- Improved Lower Bounds for Embeddings into $L_1$ (Q3654385) (← links)
- (Q4411287) (← links)
- (Q4471269) (← links)
- (Q4471309) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- Local reconstruction of low‐rank matrices and subspaces (Q4597603) (← links)
- Conditional Lower Bounds for All-Pairs Max-Flow (Q4629955) (← links)
- (Q4633884) (← links)
- (Q4633899) (← links)
- (Q4633907) (← links)
- Hardness of Approximation for Vertex-Connectivity Network Design Problems (Q4651489) (← links)
