ISAAC
1992
Springer
14 years 3 months ago
1992
Springer
Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...
ISAAC
1992
Springer
14 years 3 months ago
1992
Springer
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
WDAG
1994
Springer
14 years 3 months ago
1994
Springer
This paper investigates how vector time can be used to set breakpoints in distributed computations for the purpose of analyzing and debugging distributed programs. A breakpoint is ...
ISAAC
1992
Springer
14 years 3 months ago
1992
Springer
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...
WDAG
1994
Springer
14 years 3 months ago
1994
Springer
We give an optimal, wait-free implementation of an increment register. An increment register is a concurrent object consisting of an integer-valued register with an increment oper...
ISAAC
1992
Springer
14 years 3 months ago
1992
Springer
WDAG
1993
Springer
14 years 3 months ago
1993
Springer
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...
WDAG
1993
Springer
14 years 3 months ago
1993
Springer
WADS
1993
Springer
14 years 3 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
WADS
1993
Springer
14 years 3 months ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...