#### Filter Results:

- Full text PDF available (43)

#### Publication Year

1999

2019

- This year (10)
- Last 5 years (42)
- Last 10 years (81)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit
- SIAM J. Comput.
- 2004

"# $ &%(') * + ) ', )./ 0 &'# 12% 35476 8/ 9 : 8 1; '# & ! : %(' %< = / %<> & 6 )?A@B $8/ #C D E F G,H E IKJ;LNMOH P % 1Q R %(' + ) ', S / %(') 8/. T 6 VU 6 . 6 , %W% 1A %(' ! S%< 6 . 6 +%< . %<… (More)

In this paper, we analyze local search heuristics for the k-median and facility location problems. We define the {\em locality gap\/} of a local search procedure as the maximum ratio of a locally… (More)

- Shivnath Babu, Ravi H. Motwani, Kamesh Munagala, Itaru Nishizawa, Jennifer Widom
- SIGMOD Conference
- 2004

We consider the problem of pipelined filters, where a continuous stream of tuples is processed by a set of commutative filters. Pipelined filters are common in stream applications and capture a large… (More)

Web services are becoming a standard method of sharing data and functionality among loosely-coupled systems. We propose a general-purpose Web Service Management System (WSMS) that enables querying… (More)

- Kamesh Munagala, Abhiram G. Ranade
- SODA
- 1999

We show lower bounds of Q( $ Sort(V)) for the I/Ocomplexity of graph theoretic problems like connected components, biconnected components, and minimum spanning trees, where E and V are the number of… (More)

- Sayan Bhattacharya, Gagan Goel, Sreenivas Gollapudi, Kamesh Munagala
- Theory of Computing
- 2012

- Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
- FOCS
- 2000

We present the Cost-Distance problem: nding a Steiner tree which optimizes the sum of edge costs along one metric and the sum of source-sink distances along an unrelated second metric. We give the… (More)

- Sudipto Guha, Adam Meyerson, Kamesh Munagala
- FOCS
- 2000

In this paper, we give the rst constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in layers and each layer… (More)

- Sudipto Guha, Kamesh Munagala
- STOC
- 2007

We present the first approximation algorithms for a large class of budgeted learning problems. One classicexample of the above is the budgeted multi-armed bandit problem. In this problem each arm of… (More)

- Shivnath Babu, Kamesh Munagala, Jennifer Widom, Ravi H. Motwani
- 21st International Conference on Data Engineering…
- 2005

We address the problem of executing continuous multiway join queries in unpredictable and volatile environments. Our query class captures windowed join queries in data stream systems as well as… (More)