#### Filter Results:

- Full text PDF available (83)

#### Publication Year

1996

2018

- This year (3)
- Last 5 years (17)
- Last 10 years (55)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

- Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
- SIGMOD Conference
- 1998

Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clusters with sphericalâ€¦ (More)

- Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
- ICDE
- 1999

Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) similarity measure inâ€¦ (More)

- Sudipto Guha, Samir Khuller
- Algorithmica
- 1996

The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to be either in the dominating set, or adjacent to some vertex inâ€¦ (More)

- Sudipto Guha, Samir Khuller
- SODA
- 1998

A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some commodity. There areâ€¦ (More)

- Moses Charikar, Chandra Chekuri, +4 authors Ming Li
- SODA
- 1998

We give the first non-trivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs. These problems have several applications inâ€¦ (More)

- Sudipto Guha, Adam Meyerson, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan
- IEEE Trans. Knowl. Data Eng.
- 2003

The data stream model has recently attracted attention for its applicability to numerous types of data, including telephone records, web documents and clickstreams. For analysis of such data, theâ€¦ (More)

- Moses Charikar, Sudipto Guha
- FOCS
- 1999

We present improved combinatorial approximation algorithms for the uncapacitated facility location and k-median problems. Two central ideas in most of our results are cost scaling and greedyâ€¦ (More)

- Sudipto Guha, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan
- FOCS
- 2000

W e study clustering under the data stream model of computation where: given a sequence of points, the objective is to maintain a consistently good clustering of the sequence observed so far, using aâ€¦ (More)

- Sudipto Guha, Kamesh Munagala
- ArXiv
- 2007

The celebrated multi-armed bandit problem in decision theory models the central trade-off between exploration, or learning about the state of a system, and exploitation, or utilizing the system. Inâ€¦ (More)

- Moses Charikar, Sudipto Guha
- SIAM J. Comput.
- 2005

We present improved combinatorial approximation algorithms for the uncapacitated facility location problem. Two central ideas in most of our results are cost scaling and greedy improvement. Weâ€¦ (More)