作者: A.K. Clementi , G. Huiban , G. Rossi , Y.C. Verhoeven , P. Penna
DOI: 10.1109/IPDPS.2003.1213407
关键词:
摘要: We present a technique to evaluate the approximation ratio on random instances of minimum energy broadcast problem in ad-hoc radio networks which is known be NP-hard and approximable within 12. Our relies polynomial-time computable lower bound optimal cost any instance. The main result this paper that has never achieved value greater than 6.4. Furthermore, worst values are for small network sizes. also provide clear geometrical motivation such good results.