![Theoretical computer science / Routing algorithms / Routing / Shortest path problem / Routing and wavelength assignment / Link-state routing protocol / Mathematics / Graph theory / Network theory Theoretical computer science / Routing algorithms / Routing / Shortest path problem / Routing and wavelength assignment / Link-state routing protocol / Mathematics / Graph theory / Network theory](https://www.pdfsearch.io/img/08e9a7dabb35e89c8752dbf15371621e.jpg)
| Document Date: 2009-11-13 17:38:42 Open Document File Size: 176,55 KBShare Result on Facebook
City Cincinnati / San Francisco / Barcelona / Tel Aviv / / Company IBM / / Country Israel / Spain / / / Facility Design Centre / Nanyang Technological University / / IndustryTerm actual network / node placement algorithms / polynomial time approximation algorithm / node placement algorithm / greedy algorithm / Internet instrumentation / Internet data analysis / greedy approximation algorithm / combinatorial search / real-systems / adaptive applications / Internet Measurement Conference / probe station selection algorithm / larger networks / approximation algorithms / / Organization Research Development and Design Centre / Cooperative association / IMC / Nanyang Technological University / Singapore / / Person John Byers / Si / Max Degree / A. Lakhina / Y. Bejerano / A. Medina / I. Matta / Rajeev Rastogi / Dinesh Patil / Deepak Jeswani / John Augustine / / ProvinceOrState Ohio / California / / Technology past algorithms / proposed algorithm / greedy approximation algorithm / tomography / Random node placement algorithms / SNR algorithm / greedy algorithm / Max Degree algorithm / approximation algorithms / proposed algorithms / Simulation / polynomial time approximation algorithm / Random node placement algorithm / network operations center / using approximation algorithms / probe station selection algorithm / / URL http /
SocialTag |