Local Search Heuristics for k-median and facility location problems
SIAM Journal on Computing, 33(3):544-562, 2004.
(with V. Arya, R. Khandekar, A Meyerson, K. Munagala and V. Pandit)
Min-max tree covers
Operations Research Letters,
32(4):309-315, 2004.
(with G. Even, J. Koenemann, R. Ravi and A. Sinha)
Multiway cuts in directed and node weighted graphs.
Journal of Algorithms, 50(1):49-61, 2004.
(with V.V. Vazirani, and M. Yannakakis)
Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations.
Wireless Networks, 8(1):49-60, 2002.
(with M. Papatriantafilou and P. Tsigas)
Minimizing stall time in single and parallel disk systems.
Journal of the ACM, 47(6):969-986, 2000.
(with S. Albers and S. Leonardi)
A polylogarithmic approximation algorithm for the group steiner tree problem.
Journal of Algorithms, 37(1):66-84, 2000.
(with G. Konjevod and R. Ravi)
On the single-source unsplittable flow problem.
Combinatorica 19(1):17-41, 1999.
(with Y. Dinitz and M.X. Goemans)
The p-neighbor k-center problem.
Information Processing Letters, 65(3):131-134, 1998.
(with S. Chaudhuri and R. Ravi)
Finding separator cuts in planar graphs within twice the optimal.
SIAM Journal on Computing, 29(1):159-179, 1999.
(with H. Saran and V.V. Vazirani)
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane.
Algorithmica, 18(1):111-121, 1997.
(with D.S. Hochbaum)
Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover.
Algorithmica, 18(1):3-20, 1997.
(with V.V. Vazirani, and M. Yannakakis)
Approximate max-flow min-(multi)cut theorems and their applications.
SIAM Journal on Computing, 25(2):235-251, 1996.
(with V.V. Vazirani, and M. Yannakakis)
A polyhedron with all s--t cuts as vertices, and adjacency of cuts.
Mathematical Programming (A), 70(1):17-25, 1995.
(with V.V. Vazirani)
