Simple paths with exact and forbidden lengths
Résumé
We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximation algorithms are suggested.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...