On the Minimum Eccentricity Isometric Cycle Problem
Résumé
In this paper we investigate the Minimum Eccentricity Isometric Cycle (MEIC) problem. Given a graph, this problem consists in finding an isometric cycle with smallest possible eccentricity k. We show that this problem is NP-Hard and we propose a 3-approximation algorithm running in O(n(m + kn)) time.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...