@inproceedings{f928da7db7dc4c5da620342284ae8300,

title = "The complexity of bottleneck labeled graph problems",

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.",

author = "Refael Hassin and J{\'e}r{\^o}me Monnot and Danny Segev",

year = "2007",

doi = "10.1007/978-3-540-74839-7_31",

language = "אנגלית",

isbn = "3540748385",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "328--340",

booktitle = "Graph-Theoretic Concepts in Computer Science - 33rd International Workshop, WG 2007, Revised Papers",

note = "null ; Conference date: 21-06-2007 Through 23-06-2007",

}