#### Filter Results:

- Full text PDF available (63)

#### Publication Year

1997

2019

- This year (13)
- Last 5 years (54)
- Last 10 years (87)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Anupam Gupta, Robert Krauthgamer, James R. Lee
- FOCS
- 2003

The doubling constant of a metric space(X; d) is the smallest value such that every ball inX can be covered by balls of half the radius. Thedoubling dimensionof X is then defined as dim(X) = log2 . Aâ€¦ (More)

- Eran Halperin, Robert Krauthgamer
- STOC
- 2003

We provide the first hardness result of a polylogarithmic approximation ratio for a natural NP-hard optimization problem. We show that for every fixed <i>Îµ>0</i>, the GROUP-STEINER-TREE problemâ€¦ (More)

- Robert Krauthgamer, James R. Lee
- SODA
- 2004

We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximity search (nearest neighbor and range queries) and updates to Sâ€¦ (More)

- Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar
- computational complexity
- 2005

We show that the Multicut, Sparsest-Cut, and Min-2CNFÂ â‰¡Â Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot (2002). Aâ€¦ (More)

- Robert Krauthgamer, Uriel Feige
- SIAM Review
- 2006

The distance to monotonicity of a sequence is the minimum number of edit operations required to transform the sequence into an increasing order; this measure is complementary to the length of theâ€¦ (More)

- Robert Krauthgamer, Yuval Rabani
- SODA
- 2006

We simplify and improve upon recent lower bounds on the minimum distortion of embedding certain finite metric spaces into <i>l</i><inf>1</inf>. In particular, we show that for infinitely many valuesâ€¦ (More)

- Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
- 45th Annual IEEE Symposium on Foundations ofâ€¦
- 2004

Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to approximate it toâ€¦ (More)

- Elad Hazan, Robert Krauthgamer
- SIAM J. Comput.
- 2009

The quest for a PTAS for Nash equilibrium in a two-player game seeks to circumvent the PPADcompleteness of an (exact) Nash equilibrium by finding an approximate equilibrium, and has emerged as aâ€¦ (More)

- Robert Krauthgamer, Joseph Naor, Roy Schwartz
- SODA
- 2009

We consider the k-balanced partitioning problem, where the goal is to partition the vertices of an input graph G into k equally sized components, while minimizing the total weight of the edgesâ€¦ (More)