Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/608334
Title: Approximation algorithms for covering and packing problems on paths
Researcher: Pal, Arindam
Guide(s): Garg, Naveen and Amit Kumar
Keywords: Computer Science
Computer Science Information Systems
Engineering and Technology
University: Indian Institute of Technology Delhi
Completed Date: 2012
Abstract: Abstract Available
Pagination: NA
URI: http://hdl.handle.net/10603/608334
Appears in Departments:Department of Computer Science and Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File44.91 kBAdobe PDFView/Open
02_prelim pages.pdf182.59 kBAdobe PDFView/Open
03_content.pdf121.07 kBAdobe PDFView/Open
04_abstract.pdf112.74 kBAdobe PDFView/Open
05_chapter 1.pdf343.72 kBAdobe PDFView/Open
06_chapter 2.pdf299.38 kBAdobe PDFView/Open
07_chapter 3.pdf305.2 kBAdobe PDFView/Open
08_chapter 4.pdf286.56 kBAdobe PDFView/Open
09_chapter 5.pdf397.64 kBAdobe PDFView/Open
10_chapter 6.pdf202.95 kBAdobe PDFView/Open
11_annexures.pdf127.09 kBAdobe PDFView/Open
80_recommendation.pdf227.85 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: