Marta, Zé Luis and myself developed a new algorithm for
ranking loopless paths. It has nothing of similar with **MS** algorithm.
The first draft of the paper is done (some minor revisions are needed);
so I hope to have the paper on line in very few days.

A second C code version for Eppstein algorithm is finally online.

The first draft of the paper describing
**MS** algorithm is finally finished and online.

Two C codes for Yen's algorithm are on line since two days ago. The second
code was intended to be a computational improvement to the first one, but
it seems to be no more effient than the first code. Marta is the author of
both codes.

The first draft of the paper describing **MS** algorithm it is almost
finished. It is only missing the **Computational Experiments** paragraph.

The first C code version for **Eppstein's algorithm** is on line since a
couple of months ago. Zé Luis wrote a second C code version too
for this algorithm which will be on line as soon as he has a little free time.

The draft of the paper continues to be a project yet... I think to
begin by all next month. (It is a promise). However **I hope to be at
IFORS 96** in Vancouver with a talk about the algorithm. (My registration
followed yesterday).

Marta is drawing her attention for the loopless path problem. She wrote a C code for Yen's algorithm which will be on line as soon as she has a little free time.

The C code for **MS** algorithm is on line since some days ago. In the
meanwhile the research team is reinforced with Marta and the draft of the paper
is a project yet... Now I am being the lazy...

We are also preparing the C code for Eppstein's algorithm, in order to put it on line. I hope the work is finished very soon...

The C code for the algorithm is now ready, but... Zé Luis have to write the "HELP" file... and he is being a little lazy...

I am begining to write the first draft of the paper.

In the meanwhile, the research team (I and Zé Luis) is working on a new algorithm for the ranking of shortest trees.

At the moment I am working with José Luis Esteves dos Santos, on the last published K shortest paths ranking algorithm (see published papers), to decrease its complexity in order the required memory space.

Interesting results have been recently obtained which we intend to submit for publication as soon as possible. (April 11, 1995)

- Execution Times: (GIF - 9171K) / (PS - 7348K)
- Number of Nodes Growth: (GIF - 9135K) / (PS - 10484K)
- Number of Elementary Paths (%) until K: (GIF - 8026K) / (PS - 7389K)
- Number of Problems (%) that run until K:
(GIF - 10255K) / (PS - 7253K)
**BACK**