Searching for authors named Anupam Gupta – sorted by Relevance.
69 documents found, showing 1 through 10.
Next 10 →
-
Improved bandwidth approximation for trees
- … to be max If(i) - l(J)l, (~,j)EE Anupam Gupta* Computer Science Division University of California Berkeley…
- Cited by 5 (0 self) – Add To MetaCart
-
Embedding tree metrics into low dimensional Euclidean spaces
- …Embedding tree metrics into low dimensional Euclidean spaces Anupam Gupta Abstract We consider…
- Cited by 16 (0 self) – Add To MetaCart
-
An elementary proof of the Johnson-Lindenstrauss Lemma
- …-Lindenstrauss Lemma Sanjoy Dasgupta Anupam Gupta y TR-99-006 Abstract The Johnson-Lindenstrauss lemma shows…
- Add To MetaCart
-
On Hierarchical Routing in Doubling Metrics
- …Abstract Hubert T-H. Chan On Hierarchical Routing in Doubling Metrics Anupam Gupta We study…
- Add To MetaCart
-
Steiner Points in Tree Metrics Don't (really) Help
- …Steiner points in tree metrics don't (really) help Anupam Gupta # Computer Science Division…
- Add To MetaCart
-
Improved Embeddings of Graph Metrics into Random Trees
- …Abstract Improved Embeddings of Graph Metrics into Random Trees ∗ Kedar Dhamdhere Anupam Gupta…
- Add To MetaCart
-
Lecture 5: Primal-Dual Algorithms and Facility Location
- … and Facility Location Jan 29, 2008 Lecturer: Anupam Gupta Scribe: Varun Gupta In the last lecture, we saw an LP…
- Add To MetaCart
-
Graph Algorithms for Planning and Partitioning
- …, Chair Anupam Gupta R. Ravi Moses Charikar, Princeton University Submitted in partial fulfillment…
- Add To MetaCart
-
Exploring the Trade-off Between Label Size and Stack Depth in MPLS Routing
- …Exploring the Trade-off Between Label Size and Stack Depth in MPLS Routing Anupam Gupta Department…
- Cited by 4 (0 self) – Add To MetaCart
-
An Improved Approximation Ratio for the Covering Steiner Problem. On the Covering Steiner problem
- … Approximation Ratio for the Covering Steiner Problem ∗ Anupam Gupta † Aravind Srinivasan ‡ Received: August 4…
- Cited by 2 (1 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
