• Home
  • Brief Profile of the Awardee

Brief Profile of the Awardee

awardee

Dr Naveen Garg

  • 2016
  • Mathematical Sciences
  • 12/03/1971
  • Algorithms and complexity (Theoretical Computer Science)
Award Citation:

Dr Garg has made outstanding contributions in solving scheduling and facility location problems using mathematical programming techniques.

Academic Qualifications:
NA
Thesis and Guide details:
NA
Details of CSIR Fellowship/ Associateship held, if any or from other sources/ agencies.
NA
Significant foreign assignments:
NA
(a) Significant contributions to science and/ or technology development by the nominee based on the work done in India during most part of last 5 years:
Naveen Garg’s contributions are primarily in the design and analysis of approximation algorithms for NP-hard combinatorial optimization problems arising in network design, scheduling, routing, facility location etc. His earlier contributions include extending the celebrated Max-flow min-cut theorem of Ford and Fulkerson to multicommodity flows and developing the primal dual framework to obtain fast approximate solutions for packing and covering linear programs. Over the last few years Naveen has been working on problems arising in “Scheduling” and “Facility Location”, two areas which are important both to the Computer Science and Operations Research communities. Naveen has been instrumental in introducing tools from linear optimization to the design of online algorithms for job-scheduling problems. [1], now a landmark result in this area, shows how “dual-fitting” - a technique used extensively in the design of Approximation Algorithms - can be adapted to analyze and improve upon algorithms for minimizing weighted flow time. The approach developed in this paper has been extended to a host of other scheduling problems using a variety of stronger formulations such as convex programs, Fenchel duality etc. In [2], Naveen and his coauthors identified a limitation of their approach in [1], and [3] proposes a new model – of rejecting a small fraction of jobs – to analyze the behavior of online algorithms. [3] once again uses techniques from linear optimization to design and analyze the first algorithms for maximum weighted flow time and other related problems. Researchers in the scheduling community continue to build on techniques from [1] and [3] to analyze algorithms for problems which were hitherto considered hopeless; the latest of these is a result on minimizing flow-time when jobs cannot be pre-empted. On the other hand, facility location problems, especially those involving hard capacity constraints are not amenable to efficient solutions using linear optimization techniques. For over 50 years the method of choice for solving these problems has been “Local Search”, which although easy to describe, tends to be notoriously hard to analyze. In [4] Naveen and his coauthors provide the first tight bound for facility location problems with uniform capacities when the local search step involves the obvious add, delete, swap operations. [5] considers the setting of non-uniform capacities and obtains tight bounds for a similar natural set of local search operations. Both results significantly extend existing analysis techniques for facility location problems and rely on delicate and careful accounting of local search operations. A common thread that emerges in both these lines of work that Naveen has pursued is the emphasis on analyzing simple, natural, easily implementable algorithms. In facility location this analysis is done through careful book-keeping while for scheduling problems it is achieved using mathematical programming techniques.
(b) Impact of the contributions in the field concerned:
Naveen’s research is theoretical in nature and his contributions would therefore classify as “basic”.
Places where work of last 5 years has been referred/ cited in Books, Reviews:
(i). Paper Cited
NA
(ii). Book Cited
NA
Names of the industries in which the technology (ies) has (have) been used :
NA
The achievements already been recognised by Awards by any learned body:
NA
The Awardee a fellow of the Indian National Science Academy/Indian Academy of Sciences/National Academy of Sciences/Others:
The Awardee delivered invited lecture(s) in India/abroad and/or chaired any scientific Internatiional Conference Symposium:
NA
List of Awardee's 10 most significant publications.
NA
List of Awardee's 5 most significant publications during the last 5 years
NA
List of Awardee's 5 most significant publications from out of work done in India during the last five years:
NA
Complete list of publications in standard refereed journals:
NA
Complete list of publications with foreign collaborators (indicating your status as author):
NA
List of papers published in Conferences /Symposia/ Seminars, etc:
NA
List of the most outstanding Technical Reports/ Review Articles:
NA
Statement regarding collaboration with scientists abroad:
List of Patents taken
NA
Total number of patents granted in last five years.
Details of Books published:
NA

Contact Details


  • Department of Computer Science & Engineering
    Indian Institute of Technology Delhi
    Hauz Khas
    New Delhi - 110 016
    Delhi INDIA
  • 011-26591296
  • 011-26581060
  • naveen[at]cse[dot]iitd[dot]ernet[dot]in
27 Jun 2017, http://ssbprize.gov.in/Content/Detail.aspx?AID=523