Browse by Fellow

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 26.

Aggarwal, Ankit ; Louis, Anand ; Bansal, Manisha ; Garg, Naveen ; Gupta, Neelima ; Gupta, Shubham ; Jain, Surabhi (2013) A 3-approximation algorithm for the facility location problem with uniform capacities Mathematical Programming, 141 (1). pp. 527-547. ISSN 0025-5610

Bansal, Manisha ; Garg, Naveen ; Gupta, Neelima (2012) A 5-approximation for capacitated facility location In: ESA'12 Proceedings of the 20th Annual European Conference on Algorithms, September 10-12, 2012, Ljubljana, Slovenia.

Garg, Naveen ; Kavitha, Telikepalli ; Kumar, Amit ; Mehlhorn, Kurt ; Mestre, Julian (2010) Assigning papers to referees Algorithmica, 58 (1). pp. 119-136. ISSN 0178-4617

Garg, Naveen ; Konemann, Jochen (2006) Faster and simpler algorithms for multicommodity flow and other fractional packing problems SIAM Journal on Computing, 37 (2). pp. 630-652. ISSN 0097-5397

Even, G. ; Garg, N. ; Konemann, J. ; Ravi, R. ; Sinha, A. (2004) Min–max tree covers of graphs Operations Research Letters, 32 (4). pp. 309-315. ISSN 0167-6377

Garg, Naveen ; Vazirani, Vijay V. ; Yannakakis, Mihalis (2004) Multiway cuts in directed and node weighted graphs Journal of Algorithms, 50 (1). pp. 49-61. ISSN 0196-6774

Arya, Vijay ; Garg, Naveen ; Khandekar, Rohit ; Meyerson, Adam ; Munagala, Kamesh ; Pandit, Vinayaka (2004) Local search heuristics for k-Median and facility location problems SIAM Journal on Computing, 33 (3). pp. 544-562. ISSN 0097-5397

Garg, Naveen ; Khandekar, Rohit ; Kunal, Keshav ; Pandit, Vinayaka (2003) Bandwidth maximization in multicasting In: 11th Annual European Symposium, September 16-19, 2003, Budapest, Hungary.

Garg, N. ; Khandekar, R. (2002) Fast approximation algorithms for fractional Steiner forest and related problems In: The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, November 19, 2002, Vancouver, BC, Canada.

Garg, N. ; Young, N. E. (2002) On-line end-to-end congestion control In: The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, November 19-19, 2002, Vancouver, BC, Canada.

Garg, Naveen ; Khandekar, Rohit ; Konjevod, Goran ; Ravi, R. ; Salman, F. S. ; Sinha, Amitabh (2001) On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem In: 2001 Proceedings International Conference on Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, June 13-15, 2001, Utrecht, The Netherlands.

Albers, Susanne ; Garg, Naveen ; Leonardi, Stefano (2000) Minimizing stall time in single and parallel disk systems Journal of the ACM, 47 (6). pp. 969-986. ISSN 1535-9921

Garg, Naveen ; Konjevod, Goran ; Ravi, R. (2000) A polylogarithmic approximation algorithm for the group steiner tree problem Journal of Algorithms, 37 (1). pp. 66-84. ISSN 0196-6774

Dinitz, Yefim ; Garg, Naveen ; Goemans, Michel X. (1999) On the single-source unsplittable flow problem Combinatorica, 19 (1). pp. 17-41. ISSN 0209-9683

Garg, Naveen ; Saran, Huzur ; Vazirani, Vijay V. (1999) Finding separator cuts in planar graphs within twice the optimal SIAM Journal on Computing, 29 (1). pp. 159-179. ISSN 0097-5397

Garg, Naveen ; Jain, Sachin ; Swamy, Chaitanya (1999) A randomized algorithm for flow-shop scheduling In: Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science, December 13-15, 1999, Chennai, India.

Chaudhuri, Shiva ; Garg, Naveen ; Ravi, R. (1998) The p-neighbor k-center problem Information Processing Letters, 65 (3). pp. 131-134. ISSN 0020-0190

Koenemann, J. ; Garg, N. (1998) Faster and simpler algorithms for multicommodity flow and other fractional packing problems In: Proceedings of thr 39th Annual Symposium on Foundations of Computer Science,, November 08-11, 1998, Palo Alto, CA, USA.

Garg, N. ; Hochbaum, D. S. (1997) An O(logk)-approximation algorithm for thek minimum spanning tree problem in the plane Algorithmica, 18 (1). pp. 111-121. ISSN 0178-4617

Garg, N. ; Vazirani, V. V. ; Yannakakis, M. (1997) Primal-dual approximation algorithms for integral flow and multicut in trees Algorithmica, 18 (1). pp. 3-20. ISSN 0178-4617

Garg, N. (1996) A 3-approximation algorithm for the minimum tree spanning k vertices In: FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science, October 14-16, 1996, Burlington, VT, USA.

Garg, Naveen ; Vazirani, Vijay V. ; Yannakakis, Mihalis (1996) Approximate max-flow min-(multi)cut theorems and their applications SIAM Journal on Computing, 25 (2). pp. 235-251. ISSN 0097-5397

Garg, N. ; Papatriantafilou, M. ; Tsigas, P. (1996) Distributed list coloring: how to dynamically allocate frequencies to mobile base stations In: Eighth IEEE Symposium on Parallel and Distributed Processing, October 23-26, 1996, New Orleans, LA, USA.

Garg, Naveen ; Vazirani, Vijay V. (1995) A polyhedron with alls-t cuts as vertices and adjacency of cuts Mathematical Programming, 70 (1). pp. 17-25. ISSN 0025-5610

Garg, N. ; Saran, H. ; Vazirani, V. V. (1994) Finding separator cuts in planar graphs within twice the optimal In: 35th Annual Symposium on Foundations of Computer Science, November 20-22, 1994, Santa Fe, NM, USA.

Garg, Naveen ; Vazirani, Vijay V. ; Yannakakis, Mihalis (1993) Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover In: CALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming, July 05-09, 1993, Lund, Sweden.

This list was generated on Sun Oct 2 17:15:50 2022 UTC.