The complexity of bottleneck labeled graph problems

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present hardness results, approximation heuristics, and exact algorithms for 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.

Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science - 33rd International Workshop, WG 2007, Revised Papers
PublisherSpringer Verlag
Pages328-340
Number of pages13
ISBN (Print)3540748385, 9783540748380
DOIs
StatePublished - 2007
Event33rd International Conference Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007 - Dornburg, Germany
Duration: 21 Jun 200723 Jun 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4769 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference33rd International Conference Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007
Country/TerritoryGermany
CityDornburg
Period21/06/0723/06/07

Fingerprint

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

Cite this