#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1996

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Samir Khuller, Yoram J. Sussmann
- SIAM J. Discrete Math.
- 2000

The capacitated K-center problem is a fundamental facility location problem, where we are asked to locate K facilities in a graph, and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. Moreover, each facility may be assigned at most L vertices. This problem is known to be NP-hard.… (More)

- Samir Khuller, Robert Pless, Yoram J. Sussmann
- Theor. Comput. Sci.
- 1997

The basic K-center problem is a fundamental facility location problem, where we are asked to locate K facilities in a graph, and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. This problem is known to be NP-hard, and several optimal approximation algorithms that achieve a… (More)

- Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann
- SODA
- 1999

In this paper we study the problem of computing a spanning tree T in a connected graph G = (V, E) so as to maximize the number of vertices of full degree (FDST). These are vertices whose degree in the tree T is the same as their degree in the graph G. First mentioned by Lewinter [5], this problem is central in the work of Pothof and Schut [7], which has to… (More)

- Gísli R. Hjaltason, Hanan Samet, Yoram J. Sussmann
- ACM-GIS
- 1997

Spatial indexes, such as the PMR quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve spatial joins. We investigate the issue of speeding up building PMR quadtrees for a set of objects and develop two approaches to achieve this goal. In an empirical study, we find… (More)

- Samir Khuller, Yoram J. Sussmann
- ESA
- 1996

- Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann
- J. Comb. Optim.
- 1998

Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlying network could be used to model a city street network for emergency facility location/hospitals, or an electronic network for locating information centers. In any case, it is clear that due to tra… (More)

- Christopher L. Barrett, Achla Marathe, +6 authors Heidi Thornquist
- J. Graph Algorithms Appl.
- 2003

We carry out a detailed empirical analysis of simple heuristics and provable algorithms for bilateral contract-satisfaction problems. Such problems arise due to the proposed deregulation of the electric utility industry in the USA. Given a network and a (multi)set of pairs of vertices (contracts) with associated demands, the goal is to find the maximum… (More)

- Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann
- SWAT
- 1998

- Christopher L. Barrett, Doug Cook, +6 authors Heidi Thornquist
- Algorithm Engineering
- 2001

We consider the bilateral contract satisfaction problem arising from electrical power networks due to the proposed deregulation of the electric utility industry in the USA. Given a network and a (multi)set of pairs of vertices (contracts) with associated demands, the goal is to find the maximum number of simultaneously satisfiable contracts. We study how… (More)