|
Search the dblp DataBase
Naveen Garg:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Susanne Albers, Naveen Garg, Stefano Leonardi
Minimizing Stall Time in Single and Parallel Disk Systems. [Citation Graph (1, 0)][DBLP] STOC, 1998, pp:454-462 [Conf]
- Garima Batra, Naveen Garg, Garima Gupta
Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut. [Citation Graph (0, 0)][DBLP] ESA, 2005, pp:35-46 [Conf]
- Naveen Garg, Rohit Khandekar
Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries. [Citation Graph (0, 0)][DBLP] ESA, 2004, pp:371-382 [Conf]
- Naveen Garg, Rohit Khandekar, Keshav Kunal, Vinayaka Pandit
Bandwidth Maximization in Multicasting. [Citation Graph (0, 0)][DBLP] ESA, 2003, pp:242-253 [Conf]
- Yefim Dinitz, Naveen Garg, Michel X. Goemans
On the Single-Source Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:290-299 [Conf]
- Naveen Garg
A 3-Approximation for the Minimum Tree Spanning k Vertices. [Citation Graph (0, 0)][DBLP] FOCS, 1996, pp:302-309 [Conf]
- Naveen Garg, Rohit Khandekar
Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems. [Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:500-0 [Conf]
- Naveen Garg, Jochen Könemann
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. [Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:300-309 [Conf]
- Naveen Garg, Huzur Saran, Vijay V. Vazirani
Finding separator cuts in planar graphs within twice the optimal [Citation Graph (0, 0)][DBLP] FOCS, 1994, pp:14-23 [Conf]
- Naveen Garg, Neal E. Young
On-Line End-to-End Congestion Control. [Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:303-312 [Conf]
- Naveen Garg, Sachin Jain, Chaitanya Swamy
A Randomized Algorithm for Flow Shop Scheduling. [Citation Graph (0, 0)][DBLP] FSTTCS, 1999, pp:213-218 [Conf]
- Naveen Garg, Amit Kumar
Better Algorithms for Minimizing Average Flow-Time on Related Machines. [Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:181-190 [Conf]
- Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover. [Citation Graph (0, 0)][DBLP] ICALP, 1993, pp:64-75 [Conf]
- Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
Multiway Cuts in Directed and Node Weighted Graphs. [Citation Graph (0, 0)][DBLP] ICALP, 1994, pp:487-498 [Conf]
- Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, Amitabh Sinha II
On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem. [Citation Graph (0, 0)][DBLP] IPCO, 2001, pp:170-184 [Conf]
- Naveen Garg, Vijay V. Vazirani
A polyhedron with all s-t cuts as vertices, and adjacency of cuts. [Citation Graph (0, 0)][DBLP] IPCO, 1993, pp:281-289 [Conf]
- Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha
Covering Graphs Using Trees and Stars. [Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:24-35 [Conf]
- Manica Aggarwal, Naveen Garg
A Scaling Technique for Better Network Design. [Citation Graph (0, 0)][DBLP] SODA, 1994, pp:233-240 [Conf]
- Friedrich Eisenbrand, Stefan Funke, Naveen Garg, Jochen Könemann
A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. [Citation Graph (0, 0)][DBLP] SODA, 2003, pp:517-522 [Conf]
- Naveen Garg, Rohit Khandekar, Vinayaka Pandit
Improved approximation for universal facility location. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:959-960 [Conf]
- Naveen Garg, Goran Konjevod, R. Ravi
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. [Citation Graph (0, 0)][DBLP] SODA, 1998, pp:253-259 [Conf]
- Naveen Garg, Santosh Vempala, Aman Singla
Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques. [Citation Graph (0, 0)][DBLP] SODA, 1993, pp:103-111 [Conf]
- Naveen Garg, Marina Papatriantafilou, Philippas Tsigas
Distributed List Coloring: How To Dynamically Allocate Frequencies To Mobile Base Stations. [Citation Graph (0, 0)][DBLP] SPDP, 1996, pp:18-25 [Conf]
- Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit
Local search heuristic for k-median and facility location problems. [Citation Graph (0, 0)][DBLP] STOC, 2001, pp:21-29 [Conf]
- Naveen Garg
Saving an epsilon: a 2-approximation for the k-MST problem in graphs. [Citation Graph (0, 0)][DBLP] STOC, 2005, pp:396-402 [Conf]
- Naveen Garg, Amit Kumar
Minimizing average flow time on related machines. [Citation Graph (0, 0)][DBLP] STOC, 2006, pp:730-738 [Conf]
- Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
Approximate max-flow min-(multi)cut theorems and their applications. [Citation Graph (0, 0)][DBLP] STOC, 1993, pp:698-707 [Conf]
- Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, Vinayaka Pandit, Amin Saberi, Vijay V. Vazirani
Price of Anarchy, Locality Gap, and a Network Service Provider Game. [Citation Graph (0, 0)][DBLP] WINE, 2005, pp:1046-1055 [Conf]
- Naveen Garg, Dorit S. Hochbaum
An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane. [Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:18, n:1, pp:111-121 [Journal]
- Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. [Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:18, n:1, pp:3-20 [Journal]
- Yefim Dinitz, Naveen Garg, Michel X. Goemans
On the Single-Source Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP] Combinatorica, 1999, v:19, n:1, pp:17-41 [Journal]
- Naveen Garg, Neal E. Young
On-Line End-to-End Congestion Control [Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal]
- Shiva Chaudhuri, Naveen Garg, R. Ravi
The p-Neighbor k-Center Problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:65, n:3, pp:131-134 [Journal]
- Susanne Albers, Naveen Garg, Stefano Leonardi
Minimizing stall time in single and parallel disk systems. [Citation Graph (0, 0)][DBLP] J. ACM, 2000, v:47, n:6, pp:969-986 [Journal]
- Naveen Garg, Goran Konjevod, R. Ravi
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:37, n:1, pp:66-84 [Journal]
- Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
Multiway cuts in node weighted graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:50, n:1, pp:49-61 [Journal]
- Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha
Min-max tree covers of graphs. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2004, v:32, n:4, pp:309-315 [Journal]
- Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit
Local Search Heuristics for k-Median and Facility Location Problems. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:33, n:3, pp:544-562 [Journal]
- Naveen Garg, Huzur Saran, Vijay V. Vazirani
Finding Separator Cuts in Planar Graphs within Twice the Optimal. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:29, n:1, pp:159-179 [Journal]
- Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:235-251 [Journal]
- Naveen Garg, Marina Papatriantafilou, Philippas Tsigas
Distributed Long-Lived List Colouring: How to Dynamically Allocate Frequencies in Cellular Networks. [Citation Graph (0, 0)][DBLP] Wireless Networks, 2002, v:8, n:1, pp:49-60 [Journal]
- Naveen Garg, Jochen Könemann
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:37, n:2, pp:630-652 [Journal]
Minimizing Average Flow-Time. [Citation Graph (, )][DBLP]
Minimizing Average Flow-time : Upper and Lower Bounds. [Citation Graph (, )][DBLP]
Order Scheduling Models: Hardness and Algorithms. [Citation Graph (, )][DBLP]
A 3-Approximation for Facility Location with Uniform Capacities. [Citation Graph (, )][DBLP]
Minimizing Total Flow-Time: The Unrelated Case. [Citation Graph (, )][DBLP]
Stochastic analyses for online combinatorial optimization problems. [Citation Graph (, )][DBLP]
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane. [Citation Graph (, )][DBLP]
A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.306secs
|