{"title":"Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks","authors":"M. D. Ianni, Gianlu a Rossi","doi":"10.1109/AINAW.2007.249","DOIUrl":null,"url":null,"abstract":"In this paper we provide a polynomial-time 2-approximation algorithm for the all-to-all minimum cost range assignment problem in ad-hoc wireless networks that can be modelled by generic directed weighted graphs. The best already known approximation algorithm has a logarithmic approximation fact.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"177 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINAW.2007.249","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper we provide a polynomial-time 2-approximation algorithm for the all-to-all minimum cost range assignment problem in ad-hoc wireless networks that can be modelled by generic directed weighted graphs. The best already known approximation algorithm has a logarithmic approximation fact.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
