Back to Results
First PageMeta Content
Approximation algorithm / Computational complexity theory / Doctorate


APPROXIMATION ALGORITHMS FOR COVERING AND PACKING PROBLEMS ON PATHS ARINDAM PAL DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Add to Reading List

Document Date: 2014-01-25 10:56:26


Open Document

File Size: 739,16 KB

Share Result on Facebook

City

Delhi / /

Company

IBM / /

Facility

Indian Institute of Technology Delhi / Indian Institute of Technology Delhi November / Engineering Indian Institute of Technology / PATHS ARINDAM PAL DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING INDIAN INSTITUTE OF TECHNOLOGY DELHI NOVEMBER / /

IndustryTerm

brother-in-law / /

Organization

Department of Computer Science and Engineering Indian Institute of Technology Delhi / APPROXIMATION ALGORITHMS FOR COVERING AND PACKING PROBLEMS ON PATHS ARINDAM PAL DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING INDIAN INSTITUTE OF TECHNOLOGY DELHI / ARINDAM PAL Department of Computer Science and Engineering Submitted / Department of Computer Science and Engineering Indian Institute / Department of Computer Science and Engineering / Indian Institute of Technology Delhi / /

Person

Sandeep Sen / Prashant / Roger Federer / Anindita / Sushmita / Amitabha Bagchi / Amit Kumar / Debi Prasad Pal (Jatha) / Mona / Saurav / Ragesh Jaiswal / Bani Prasad / Kanai / Swati / Naveen Garg / /

Position

doctoral research advisors / Professor / advisors / /

Technology

APPROXIMATION ALGORITHMS / 2012 APPROXIMATION ALGORITHMS / /

SocialTag