Back to Results
First PageMeta Content
Category theory / Differential topology / Embedding / General topology / Order theory / Planar graph / Randomized algorithm / Doubling measure / Mathematics / Graph theory / Topology


Metric Embeddings with Relaxed Guarantees∗ T-H. Hubert Chan† Kedar Dhamdhere‡ Anupam Gupta§
Add to Reading List

Document Date: 2008-09-03 02:26:52

Open Document

File Size: 300,09 KB

Share Result on Facebook

City

Pittsburgh / Mountain View / Ithaca / /

Company

Let us / Microsoft / Google Inc / /

Country

Germany / /

Facility

Cornell University / Carnegie Mellon University / /

IndustryTerm

randomized beacon-based algorithms / recent networking work / Internet settings / Internet latencies / machinery / nearest server / location-aware applications / approximation algorithms / /

NaturalFeature

Mountain View CA / /

Organization

National Science Foundation / Department of Computer Science / Carnegie Mellon University / Max-Planck-Institut f¨ur Informatik / Computer Science Department / Cornell University / /

Person

Anupam Gupta / H. Hubert Chan† Kedar Dhamdhere / Buu / Jon Kleinberg / Kedar Dhamdhere‡ Anupam Gupta / Jon Kleinberg¶ Aleksandrs Slivkinsk / Anupam Gupta§ Jon Kleinberg / /

/

Product

CCR / /

ProvinceOrState

Pennsylvania / New York / /

Technology

Scale Bundles Our algorithm / randomized algorithm / randomized beacon-based algorithms / embedding algorithm / approximation algorithms / peer-to-peer system / /

SocialTag