#### Filter Results:

- Full text PDF available (163)

#### Publication Year

1988

2017

- This year (4)
- Last 5 years (40)
- Last 10 years (77)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn 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 the dominating set. We focus on the related question of finding a connected dominating set of minimum size, where the graph induced by vertices in the… (More)

- Samir Khuller, Anna Moss, Joseph Naor
- Inf. Process. Lett.
- 1999

The budgeted maximum coverage problem is: given a collection S of sets with associated costs deened over a domain of weighted elements, and a budget L, nd a subset of S 0 S such that the total cost of sets in S 0 does not exceed L, and the total weight of elements covered by S 0 is maximized. This problem is NP-hard. For the special case of this problem,… (More)

- Sudipto Guha, Samir Khuller
- J. Algorithms
- 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 associated costs for locating the facilities, as well as transportation costs for distributing the commodities. We assume that the transportation costs form a… (More)

We consider an overlay architecture where service providers deploy a set of service nodes (called MSNs) in the network to efficiently implement media-streaming applications. These MSNs are organized into an overlay and act as application-layer multicast forwarding entities for a set of clients. We present a decentralized scheme that organizes the MSNs into… (More)

- Suman Banerjee, Samir Khuller
- INFOCOM
- 2001

In this paper we present a clustering scheme to create a hierarchical control structure for multi-hop wireless networks. A cluster is defined as a subset of vertices, whose induced graph is connected. In addition, a cluster is required to obey certain constraints that are useful for management and scalability of the hierarchy. All these constraints cannot… (More)

- Gagan Aggarwal, Tomás Feder, +4 authors An Zhu
- PODS
- 2006

Publishing data for analysis from a table containing personal records, while maintaining individual privacy, is a problem of increasing importance today. The traditional approach of de-identifying records is to remove identifying fields such as social security number, name etc. However, recent research has shown that a large fraction of the US population… (More)

- Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld
- Discrete Applied Mathematics
- 1996

- Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan
- SODA
- 2001

Facility location problems are traditionally investigated with the assumption that <i>all</i> the clients are to be provided service. A significant shortcoming of this formulation is that a few very distant clients, called <i>outliers</i>, can exert a disproportionately strong influence over the final solution. In this paper we explore a generalization of… (More)

- Samir Khuller, Balaji Raghavachari, Neal E. Young
- SODA
- 1993

Efficient algorithms are known for computing a minimum spann.ing tree, or a shortest path. tree (with a fixed vertex as the root). The weight of a shortest path tree can be much more than the weight of a minimum spa,nning tree. Conversely, the distance bet,ween the root, and any vertex in a minimum spanning tree may be much more than the distance bet#ween… (More)

- Samir Khuller, Uzi Vishkin
- J. ACM
- 1992

A spanning tree in a graph is the smallest connected spanning subgraph. Given a graph, how does one find the smallest (i.e., least number of edges) 2-connected spanning subgraph (connectivity refers to both edge and vertex connectivity, if not specified)? Unfortunately, the problem is known to be NP-hard.
We consider the problem of finding a better… (More)