The complexity of bottleneck labeled graph problems

Refael Hassin, Jérôme Monnot, Danny Segev

Research output: Contribution to journalArticlepeer-review


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 an s-t path, a spanning tree, or a perfect matching) while trying to minimize the maximum (or, alternatively, maximize the minimum) number of edges picked from any given color.

Original languageEnglish
Pages (from-to)245-262
Number of pages18
Issue number2
StatePublished - Oct 2010
Externally publishedYes


  • Approximation algorithms
  • Bottleneck labeled problems
  • Hardness of approximation
  • Perfect matching
  • Spanning tree
  • s-t cut
  • s-t path

ASJC Scopus subject areas

  • General Computer Science
  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'The complexity of bottleneck labeled graph problems'. Together they form a unique fingerprint.

Cite this