Back to Results
First PageMeta Content
Binary trees / NP-complete problems / Dominating set / Randomized rounding / Randomized algorithm / Rope / David Shmoys / Tango tree / Theoretical computer science / Computational complexity theory / Mathematics


Fault-Tolerant Clustering in Ad Hoc and Sensor Networks Fabian Kuhn Microsoft Research Silicon Valley 1065 La Avenida Mountain View, CA[removed]removed]
Add to Reading List

Document Date: 2006-04-05 09:53:00


Open Document

File Size: 184,86 KB

Share Result on Facebook

City

Zurich / /

Company

SIAM Journal / Mobile Ad Hoc Networks / Energy-Latency Trade / Algorithm 1 Distributed LP / primal LP / Ad Hoc Wireless Networks / /

/

IndustryTerm

wired media / feasible dual solution / distributed approximation algorithms / sensor networks / communication infrastructure / shared wireless medium / feasible solution / biological and chemical processes / suboptimal solutions / approximate solution / multi-hop wireless networks / distributed algorithms / final solution / wireless ad-hoc / distributed computing / virtual infrastructure / fractional solution / sensor systems / integer solution / fea2 sible solution / energy supply / multi-hop radio networks / multimedia radio network / wireless networks / characteristic wireless nature / a-priori infrastructure / integral solution / energy / /

Organization

Architectural Organization / LP (PP) / /

Person

Graphs Our / Thomas Moscibroda / Fabian Kuhn / /

/

Position

leader / General / /

PublishedMedium

American Journal of Mathematics / SIAM Journal on Computing / Journal of the ACM / IEEE Transactions on Communications / /

Technology

Av / distributed algorithms / Mobile Computing / Approximation Algorithms / time algorithms / RNC Approximation Algorithms / distributed approximation algorithms / /

SocialTag