NP-Completeness Results for Minimum Planar Spanners

Abstract : For any fixed parameter t greater or equal to 1, a \emph t-spanner of a graph G is a spanning subgraph in which the distance between every pair of vertices is at most t times their distance in G. A \emph minimum t-spanner is a t-spanner with minimum total edge weight or, in unweighted graphs, minimum number of edges. In this paper, we prove the NP-hardness of finding minimum t-spanners for planar weighted graphs and digraphs if t greater or equal to 3, and for planar unweighted graphs and digraphs if t greater or equal to 5. We thus extend results on that problem to the interesting case where the instances are known to be planar. We also introduce the related problem of finding minimum \emphplanar t-spanners and establish its NP-hardness for similar fixed values of t.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 1998, 3 (1), pp.1-10
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00958903
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : jeudi 13 mars 2014 - 15:52:08
Dernière modification le : mercredi 29 novembre 2017 - 10:26:24
Document(s) archivé(s) le : vendredi 13 juin 2014 - 11:52:07

Fichier

dm030101.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00958903, version 1

Collections

Citation

Ulrik Brandes, Dagmar Handke. NP-Completeness Results for Minimum Planar Spanners. Discrete Mathematics and Theoretical Computer Science, DMTCS, 1998, 3 (1), pp.1-10. 〈hal-00958903〉

Partager

Métriques

Consultations de la notice

102

Téléchargements de fichiers

287