The Complexity of Bottlemeck Labeled Graph Problems

Refael Hassin (1) , Jérôme Monnot (2) , Danny Segev (1)

1 School of Mathematical Sciences
2 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

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.

Mots clés: perfect matching; Bottleneck labeled problems; approximation algorithms; hardness of approximation; s-t path; s-t cut; spanning tree; perfect matching.

Domaines: Complexité [cs.CC]; Recherche opérationnelle [math.OC]

Refael Hassin, Jérôme Monnot, Danny Segev. The Complexity of Bottlemeck Labeled Graph Problems. 2007. ⟨hal-00178125⟩