Efficient algorithm for placing a given number of base stations to cover a convex region

Simple item page
dc.contributor.authorDas, Gautam K
dc.contributor.authorDas, Sandip
dc.contributor.authorNandy, Subhas C
dc.contributor.authorSinha, Bhabani P
dc.date.accessioned2012-10-30T11:13:12Z
dc.date.available2012-10-30T11:13:12Z
dc.date.issued2006-11
dc.identifier.citationJournal of Parallel and Distributed Computing,V. 66 ,no. 11,p.1353-1358en_US
dc.identifier.urihttp://hdl.handle.net/10263/4653
dc.language.isoenen_US
dc.subjectBase stationsen_US
dc.subjectConvex regionen_US
dc.titleEfficient algorithm for placing a given number of base stations to cover a convex regionen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Efficient algorithm for placing a given number of base stations to cover a.pdf
Size:
1.41 MB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Computer Science