BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Greece
1 × Israel
1 × Italy
1 × Latvia
1 × Sweden
1 × Switzerland
5 × USA
Collaborated with:
A.Kumar V.V.Vazirani M.Yannakakis S.Anand D.S.Hochbaum N.Megow S.Albers S.Leonardi J.S.Chadha V.N.Muralidhara K.Bringmann T.Friedrich V.Arya R.Khandekar A.Meyerson K.Munagala V.Pandit
Talks about:
flow (6) minim (5) time (5) algorithm (4) approxim (4) problem (3) weight (3) machin (3) relat (3) averag (2)

Person: Naveen Garg

DBLP DBLP: Garg:Naveen

Contributed to:

ICALP (1) 20132013
ICALP (1) 20112011
STOC 20092009
ICALP (1) 20062006
STOC 20062006
STOC 20052005
STOC 20012001
STOC 19981998
ICALP 19941994
STOC 19941994
ICALP 19931993
STOC 19931993

Wrote 12 papers:

Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines (SA, KB, TF, NG, AK), pp. 13–24.
ICALP-v1-2011-AnandGM #how #question
Meeting Deadlines: How Much Speed Suffices? (SA, NG, NM), pp. 232–243.
STOC-2009-ChadhaGKM #algorithm
A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation (JSC, NG, AK, VNM), pp. 679–684.
ICALP-v1-2006-GargK #algorithm
Better Algorithms for Minimizing Average Flow-Time on Related Machines (NG, AK), pp. 181–190.
Minimizing average flow time on related machines (NG, AK), pp. 730–738.
STOC-2005-Garg #approximate #graph #problem
Saving an epsilon: a 2-approximation for the k-MST problem in graphs (NG), pp. 396–402.
STOC-2001-AryaGKMP #heuristic #problem
Local search heuristic for k-median and facility location problems (VA, NG, RK, AM, KM, VP), pp. 21–29.
STOC-1998-AlbersGL #parallel
Minimizing Stall Time in Single and Parallel Disk Systems (SA, NG, SL), pp. 454–462.
ICALP-1994-GargVY #graph #multi
Multiway Cuts in Directed and Node Weighted Graphs (NG, VVV, MY), pp. 487–498.
STOC-1994-GargH #algorithm #approximate #problem
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane (NG, DSH), pp. 432–438.
ICALP-1993-GargVY #algorithm #approximate #multi #set
Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover (NG, VVV, MY), pp. 64–75.
STOC-1993-GargVY #approximate #multi #theorem
Approximate max-flow min-(multi)cut theorems and their applications (NG, VVV, MY), pp. 698–707.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.