TY - GEN

T1 - The complexity of bottleneck labeled graph problems

AU - Hassin, Refael

AU - Monnot, Jérôme

AU - Segev, Danny

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38549100073&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-74839-7_31

DO - 10.1007/978-3-540-74839-7_31

M3 - Conference contribution

AN - SCOPUS:38549100073

SN - 3540748385

SN - 9783540748380

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 328

EP - 340

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

PB - Springer Verlag

T2 - 33rd International Conference Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007

Y2 - 21 June 2007 through 23 June 2007

ER -