#### Filter Results:

#### Publication Year

1996

2006

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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)

The full degree spanning tree problem is deened as follows: given a connected graph G = (V; E) nd a spanning tree T so as to maximize the number of vertices whose degree in T is the same as in G (these are called vertices of \full" degree). We show that this problem is NP-hard. We also present almost optimal approximation algorithms for it assuming coR 6 =… (More)

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)

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… (More)

These notes may not be reproduced by any means (mechanical or electronic or any other) without the express written permission of Hanan Samet

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)

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)