1. DSpace at Indian Statistical Institute
  2. Dissertation and Thesis
  3. Dissertations - M Tech (CS)
Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/6459
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBandyapadhyay, Sayan-
dc.date.accessioned2016-07-12T21:10:47Z-
dc.date.available2016-07-12T21:10:47Z-
dc.date.issued2013-
dc.identifier.citation56p.en_US
dc.identifier.urihttp://hdl.handle.net/10263/6459-
dc.descriptionDissertation under the supervision of Prof. Sandip Dasen_US
dc.language.isoenen_US
dc.publisherIndian Statistical Institute, Kolkataen_US
dc.relation.ispartofseriesDissertation;13-302-
dc.subjectVoronoi gameen_US
dc.subjectGraphs algorithmsen_US
dc.subjectApproximationen_US
dc.subjectNP-completenessen_US
dc.titleVoronoi game on graphsen_US
dc.typeThesisen_US
Appears in Collections:Dissertations - M Tech (CS)

Files in This Item:
File Description SizeFormat 
DISS-302.pdfDissertation is the original PDF298.25 kBAdobe PDFView/Open
Show simple item record


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