JCO

2008

13 years 11 months ago
2008

We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...

JCO

2008

13 years 11 months ago
2008

We show that any point in the convex hull of each of (d + 1) sets of (d + 1) points in Rd is contained in at least (d + 2)2 /4 simplices with one vertex from each set.

JCO

2008

13 years 11 months ago
2008

Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...

JCO

2008

13 years 11 months ago
2008

We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...

JCO

2008

13 years 11 months ago
2008

JCO

2008

13 years 11 months ago
2008

The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...

JCO

2008

13 years 11 months ago
2008

Following previous work, we consider the hierarchical load balancing model on two machines of possibly different speeds. We first focus on maximizing the minimum machine load and ...

JCO

2008

13 years 11 months ago
2008

JCO

2008

13 years 11 months ago
2008

The identification of interaction faults in component-based systems has focussed on indicating the presence of faults, rather than their location and magnitude. While this is a va...

JCO

2008

13 years 11 months ago
2008