Scutellà, Maria Grazia (2001) An approximation algorithm for computing longest paths. 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 (91Kb) |
Official URL: http://compass2.di.unipi.it/TR/files/TR-01-04.ps.g...
Abstract
We show how the color-coding method by Alon, Yuster and Zwick, in its version specialized to compute simple paths of a specified cardinality k, can be extended to address the presence of arc lengths (the existence of such an extension was outlined by the authors for a more general color-coding algorithm, but it was not explicitely described, and its time complexity was not discussed). The extension is then used to derive approximation results for the general longest path problem.
| Item Type: | Book |
|---|---|
| Uncontrolled Keywords: | approximation algorithm, longest path |
| Subjects: | Area01 - Scienze matematiche e informatiche > INF/01 - Informatica |
| Divisions: | Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA |
| Depositing User: | dott.ssa Sandra Faita |
| Date Deposited: | 27 Jan 2015 10:32 |
| Last Modified: | 27 Jan 2015 10:32 |
| URI: | http://eprints.adm.unipi.it/id/eprint/2048 |
Repository staff only actions
| View Item |
