The shortest path tree problem is a classical and widely studied combinatorial problem. The scope of this article is to provide an extensive treatment of the major classical approaches. It then proceeds focusing on the auction algorithm and some of its recently developed variants. There is a discussion of the theoretical and practical performance of the treated methods comparing their effectiveness.
Shortest path tree algorithms / Festa, Paola. - STAMPA. - (2009), pp. 3507-3519. [10.1007/978-0-387-74759-0_605]
Shortest path tree algorithms
FESTA, PAOLA
2009
Abstract
The shortest path tree problem is a classical and widely studied combinatorial problem. The scope of this article is to provide an extensive treatment of the major classical approaches. It then proceeds focusing on the auction algorithm and some of its recently developed variants. There is a discussion of the theoretical and practical performance of the treated methods comparing their effectiveness.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
