DSpace Repository
Efficient algorithm for placing a given number of base stations to cover a convex region
- DSpace Home
- →
- Scientific Contributions of ISI
- →
- Computer Science
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Das, Gautam K | |
| dc.contributor.author | Das, Sandip | |
| dc.contributor.author | Nandy, Subhas C | |
| dc.contributor.author | Sinha, Bhabani P | |
| dc.date.accessioned | 2012-10-30T11:13:12Z | |
| dc.date.available | 2012-10-30T11:13:12Z | |
| dc.date.issued | 2006-11 | |
| dc.identifier.citation | Journal of Parallel and Distributed Computing,V. 66 ,no. 11,p.1353-1358 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10263/4653 | |
| dc.language.iso | en | en_US |
| dc.subject | Base stations | en_US |
| dc.subject | Convex region | en_US |
| dc.title | Efficient algorithm for placing a given number of base stations to cover a convex region | en_US |
| dc.type | Article | en_US |
