作者: Gautam K. Das , Sasthi C. Ghosh , Subhas C. Nandy
DOI: 10.1007/978-3-540-30536-1_46
关键词:
摘要: The unbounded version of the 1D range assignment problem for radio-stations is studied. Here a set n radio stations are placed arbitrarily on line. objective to assign ranges these such that total power consumption minimum. A simple incremental algorithm proposed which produces optimum solution in O(n3) time and O(n2) space. This improves running best known existing by factor n.