IDR - IIT Kharagpur

On the Complexity of the Knapsack Problem with Some Graph Theoretic Constraints

Show simple item record

dc.contributor.author Singh, Sipra
dc.date.accessioned 2026-05-11T05:43:28Z
dc.date.available 2026-05-11T05:43:28Z
dc.date.issued 2026-04
dc.identifier.govdoc NB19165
dc.identifier.uri http://127.0.0.1/xmlui/handle/123456789/17256
dc.language.iso en en_US
dc.publisher IIT Kharagpur en_US
dc.subject Knapsack Problem en_US
dc.subject Vertex Cover en_US
dc.subject Dominating Set en_US
dc.subject Graph Algorithms en_US
dc.subject Parameterized Complexity en_US
dc.title On the Complexity of the Knapsack Problem with Some Graph Theoretic Constraints en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account