The Complexity of Bottlemeck Labeled Graph ProblemsReport as inadecuate

The Complexity of Bottlemeck Labeled Graph Problems - Download this document for free, or read online. Document in PDF available to download.

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

Abstract : 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.

Keywords : perfect matching Bottleneck labeled problems approximation algorithms hardness of approximation s-t path s-t cut spanning tree perfect matching.

Author: Refael Hassin - Jérôme Monnot - Danny Segev -



Related documents