The complexity of Bottleneck Labeled Graph Problems - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2007

The complexity of Bottleneck Labeled Graph Problems

Résumé

In the present paper, we study bottleneck labeled optimization problems arising in the context of graph theory. This long-established model partitions the set of edges into classes, each of which is identified by a unique color. The generic objective is to construct a subgraph of prescribed structure (such as that of being an s-t path, a spanning tree, or a perfect matching) while trying to avoid over-picking or under-picking edges from any given color.
Fichier principal
Vignette du fichier
cahier_257.pdf (399.06 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00917828 , version 1 (12-12-2013)

Identifiants

  • HAL Id : hal-00917828 , version 1

Citer

Refael Hassin, Jérôme Monnot, Danny Segev. The complexity of Bottleneck Labeled Graph Problems. 2007. ⟨hal-00917828⟩
78 Consultations
285 Téléchargements

Partager

Gmail Facebook X LinkedIn More