1. DSpace at Indian Statistical Institute
  2. Scientific Contributions of ISI
  3. Computer Science
Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/4653
Full metadata record
DC FieldValueLanguage
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
Appears in Collections:Computer Science

Files in This Item:
File Description SizeFormat 
Efficient algorithm for placing a given number of base stations to cover a.pdf1.44 MBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.