Normal view MARC view ISBD view

A distributed approximation algorithm for prize-collection steiner tree problem in CONGESTED CLIQUE model by Arnob Debnath, Abhinash Kumar Giri; Angshuman Bhowmik

By:

Contributor(s):

Material type: Map

MapLanguage: English Publication details: 2023 Silchar NITDescription: xix, 30pSubject(s):

DDC classification:

Dissertation note: National Institute of Technology, Silchar Bachelor of Technology 2023

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
Dissertation	National Institute of Technology, Silchar Central Library@NITS	005 DEB (Browse shelf(Opens below))	Available		D1942

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	005.0 DAS Multimodal sentiment analysis of assamese news articles	005 DAS Data privacy preservation in cloud computing	005 DEB Regulated zone based clustering in wireless ad hoc network	005 DEB A distributed approximation algorithm for prize-collection steiner tree problem in CONGESTED CLIQUE model	005 DEK Detecting traffic rule violations in E-rickshaws using deep learning	005 DEK Devise a model for named entity recognition for Hindi language	005 DEY Assamese speech to English text translation	Next

Guided by Parikshit Saikia

National Institute of Technology, Silchar Bachelor of Technology 2023

There are no comments on this title.

to post a comment.