Naveen Garg
Organizational Behavior and Human Resource Management · 1998–2004
A researcher in the Science corpus: 4 papers; trusts 2 researchers and is trusted by 7 researchers here, as inferred from the citation graph.
Subfields
- Organizational Behavior and Human Resource Management — 8 citations into it; #4,910 of 8,741 by trust here, #4,293 by citations
- Computational Theory and Mathematics — 6 citations into it; #9,672 of 12,182 by trust here, #7,142 by citations
- Industrial and Manufacturing Engineering — 6 citations into it; #1,109 of 2,521 by trust here, #896 by citations
Whom Naveen Garg trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Kamal Kumar Jain
- Sudipto Guha
- Vijay V. Vazirani
- Moses Charikar
- Madhukar R. Korupolu
- David B. Shmoys
- Prabhakar Raghavan
Who trusts Naveen Garg overall
- Sanjeev Arora
- Harald Räcke
- Ashwinkumar Badanidiyuru
- Satyen Kale
- Kamal Kumar Jain
- Hong Chang
- Jittat Fakcharoenphol
- Paul Christiano
- Elad Hazan
- Adam Meyerson
Papers from Naveen Garg's perspective
Ordered by how strongly the researchers Naveen Garg trusts endorse each paper. Same corpus, a different order for every researcher.
- Primal-dual approximation algorithms for metric facility location and k-median problems
- Approximation algorithms for facility location problems
- Probabilistic approximation of metric spaces and its algorithmic applications
- Analysis of a local search heuristic for facility location problems (ACM-SIAM Symposium on Discrete Algorithms)
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP (JACM)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- A constant-factor approximation algorithm for the k-median problem (extended abstract)
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem (SIAM journal on computing (Print))
- Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation (JACM)
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Their papers
- A polylogarithmic approximation algorithm for the group Steiner tree problem (2000) — 392 citations
- Local Search Heuristics for k-Median and Facility Location Problems (2004) — 698 citations
- Local search heuristic for k-median and facility location problems (2001) — 391 citations
- Faster and simpler algorithms for multicommodity flow and other fractional packing problems (1998)