LATIN
2000
Springer
13 years 8 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
LATIN
2000
Springer
13 years 8 months ago
2000
Springer
LATIN
2000
Springer
13 years 8 months ago
2000
Springer
d abstract) Book section (Refereed) Original citation: Originally published in Gonnet, G; Panario D; Viola, A, LATIN 2000: theoretical informatics. Lecture notes in computer scienc...
LATIN
2000
Springer
13 years 8 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
LATIN
2000
Springer
13 years 8 months ago
2000
Springer
LATIN
2000
Springer
13 years 8 months ago
2000
Springer
LATIN
2000
Springer
13 years 8 months ago
2000
Springer
We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable...
LATIN
2000
Springer
13 years 8 months ago
2000
Springer
LATIN
2000
Springer
13 years 8 months ago
2000
Springer
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value