Sciweavers

15 search results - page 3 / 3
» jco 2008
Sort
View
JCO
2008
117views more  JCO 2008»
13 years 10 months ago
Approximation algorithms for connected facility location problems
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...
Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...
JCO
2008
134views more  JCO 2008»
13 years 10 months ago
On minimum m -connected k -dominating set problem in unit disc graphs
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 ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
JCO
2008
102views more  JCO 2008»
13 years 10 months ago
Stable matching problems with exchange restrictions
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...
Robert W. Irving
JCO
2008
66views more  JCO 2008»
13 years 10 months ago
The hierarchical model for load balancing on two machines
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 ...
Orion Chassid, Leah Epstein
JCO
2008
85views more  JCO 2008»
13 years 10 months ago
Locating and detecting arrays for interaction faults
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...
Charles J. Colbourn, Daniel W. McClary