{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T18:49:23Z","timestamp":1674240563361},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2007,6]]},"abstract":"<jats:p> In the unbounded version of the range assignment problem for all-to-all communication in 1D, a set of n radio-stations are placed arbitrarily on a line; the objective is to assign ranges to these radio-stations such that each of them can communicate with the others (using at most n - 1 hops) and the total power consumption is minimum. A simple incremental algorithm for this problem is proposed which produces optimum solution in O(n<jats:sup>3<\/jats:sup>) time and O(n<jats:sup>2<\/jats:sup>) space. This is an improvement in the running time by a factor of n over the best known existing algorithm for the same problem. <\/jats:p>","DOI":"10.1142\/s0129054107004863","type":"journal-article","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T11:31:58Z","timestamp":1179315118000},"page":"619-635","source":"Crossref","is-referenced-by-count":2,"title":["IMPROVED ALGORITHM FOR MINIMUM COST RANGE ASSIGNMENT PROBLEM FOR LINEAR RADIO NETWORKS"],"prefix":"10.1142","volume":"18","author":[{"given":"GAUTAM K.","family":"DAS","sequence":"first","affiliation":[{"name":"Indian Statistical Institute, Kolkata - 700 108, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SASTHI C.","family":"GHOSH","sequence":"additional","affiliation":[{"name":"Dept. of Electrical and Computer Engineering, McMaster University, Ontario, Canada - L8S4K1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SUBHAS C.","family":"NANDY","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, Kolkata - 700 108, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1109\/90.282605"},{"key":"rf4","volume-title":"Wireless Information Networks","author":"Pahlavan K.","year":"1995"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1109\/26.681417"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00223-0"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01262051"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0985-2"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00538-8"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.11.046"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054107004863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:30:03Z","timestamp":1565191803000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054107004863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":8,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,6]]}},"alternative-id":["10.1142\/S0129054107004863"],"URL":"https:\/\/doi.org\/10.1142\/s0129054107004863","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6]]}}}