Sciweavers

LATIN
2000
Springer
13 years 9 months ago
Small Maximal Matchings in Random Graphs
We look at the minimal size of a maximal matching in general, bipartite and
Michele Zito
LATIN
2000
Springer
13 years 9 months ago
Equivalent Conditions for Regularity (Extended Abstract)
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...
Yoshiharu Kohayakawa, Vojtech Rödl, Jozef Sko...
LATIN
2000
Springer
13 years 9 months ago
Approximation Algorithms for Flexible Job Shop Problems
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...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...
LATIN
2000
Springer
13 years 9 months ago
Finding Skew Partitions Efficiently
Celina M. Herrera de Figueiredo, Sulamita Klein, Y...
LATIN
2000
Springer
13 years 9 months ago
The LCA Problem Revisited
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...
Michael A. Bender, Martin Farach-Colton
LATIN
2000
Springer
13 years 9 months ago
A Fully Dynamic Algorithm for Distributed Shortest Paths
Serafino Cicerone, Gabriele Di Stefano, Daniele Fr...
LATIN
2000
Springer
13 years 9 months ago
Worst-Case Complexity of the Optimal LLL Algorithm
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
Ali Akhavi