Pallottino, Stefano and Scutellà, Maria Grazia (2001) A new algorithm for reoptimizing shortest paths when the arc costschange. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.
![[img]](http://eprints.adm.unipi.it/style/images/fileicons/application_postscript.png) | Postscript (GZip) - Published Version Available under License Creative Commons Attribution No Derivatives. Download (163Kb) |
Official URL: http://compass2.di.unipi.it/TR/files/TR-01-11.ps.g...
Abstract
We propose an algorithm which reoptimizes shortest paths in a very general situation, that is when any subset of arcs of the input graph is affected by a change of the arc costs, which can be either lower or higher than the old ones. This situation is more general than the ones addressed in the literature so far.
| Item Type: | Book |
|---|---|
| Uncontrolled Keywords: | shortest paths, reoptimization, flow algorithms |
| Subjects: | Area01 - Scienze matematiche e informatiche > INF/01 - Informatica |
| Divisions: | Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA |
| Depositing User: | dott.ssa Sandra Faita |
| Date Deposited: | 21 Jan 2015 15:06 |
| Last Modified: | 21 Jan 2015 15:06 |
| URI: | http://eprints.adm.unipi.it/id/eprint/2054 |
Repository staff only actions
| View Item |
