Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
Networking
/
Paper
Fast Approximate Algorithms for Maximum Lifetime Routing in Wireless Ad-hoc Networks.
Jae-Hwan Chang
,
Leandros Tassiulas
Venue
B
Networking
Year
2000
Proceedings
NETWORKING
DBLP record
conf/networking/ChangT00 ↗
Browse the full
Networking paper archive
.