The complexity of bottleneck labeled graph problems

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

doi:10.1007/978-3-540-74839-7_31

The complexity of bottleneck labeled graph problems

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Graph-Theoretic Concepts in Computer Science - 33rd International Workshop, WG 2007, Revised Papers
Publisher	Springer Verlag
Pages	328-340
Number of pages	13
ISBN (Print)	3540748385, 9783540748380
DOIs	https://doi.org/10.1007/978-3-540-74839-7_31
State	Published - 2007
Externally published	Yes
Event	33rd International Conference Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007 - Dornburg, Germany Duration: 21 Jun 2007 → 23 Jun 2007

Publication series

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

Conference

Conference	33rd International Conference Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007
Country/Territory	Germany
City	Dornburg
Period	21/06/07 → 23/06/07

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

Hassin, R., Monnot, J., & Segev, D. (2007). The complexity of bottleneck labeled graph problems. In Graph-Theoretic Concepts in Computer Science - 33rd International Workshop, WG 2007, Revised Papers (pp. 328-340). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4769 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-74839-7_31

Hassin, Refael ; Monnot, Jérôme ; Segev, Danny. / The complexity of bottleneck labeled graph problems. Graph-Theoretic Concepts in Computer Science - 33rd International Workshop, WG 2007, Revised Papers. Springer Verlag, 2007. pp. 328-340 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{c7c181e1e6304e589a34e0a34e7dac58,

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 = "English",

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

address = "Germany",

note = "33rd International Conference Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007 ; Conference date: 21-06-2007 Through 23-06-2007",

}

Hassin, R, Monnot, J & Segev, D 2007, The complexity of bottleneck labeled graph problems. in Graph-Theoretic Concepts in Computer Science - 33rd International Workshop, WG 2007, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4769 LNCS, Springer Verlag, pp. 328-340, 33rd International Conference Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007, Dornburg, Germany, 21/06/07. https://doi.org/10.1007/978-3-540-74839-7_31

The complexity of bottleneck labeled graph problems. / Hassin, Refael; Monnot, Jérôme; Segev, Danny.
Graph-Theoretic Concepts in Computer Science - 33rd International Workshop, WG 2007, Revised Papers. Springer Verlag, 2007. p. 328-340 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4769 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 -

Hassin R, Monnot J, Segev D. The complexity of bottleneck labeled graph problems. In Graph-Theoretic Concepts in Computer Science - 33rd International Workshop, WG 2007, Revised Papers. Springer Verlag. 2007. p. 328-340. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-74839-7_31

The complexity of bottleneck labeled graph problems

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this