The complexity of bottleneck labeled graph problems

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

doi:10.1007/s00453-008-9261-4

The complexity of bottleneck labeled graph problems

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

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	245-262
Number of pages	18
Journal	Algorithmica
Volume	58
Issue number	2
DOIs	https://doi.org/10.1007/s00453-008-9261-4
State	Published - Oct 2010
Externally published	Yes

Keywords

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

Access to Document

10.1007/s00453-008-9261-4

Cite this

@article{6fcff87616654532aee8dee40e5f1500,

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

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

keywords = "Approximation algorithms, Bottleneck labeled problems, Hardness of approximation, Perfect matching, Spanning tree, s-t cut, s-t path",

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

year = "2010",

month = oct,

doi = "10.1007/s00453-008-9261-4",

language = "English",

volume = "58",

pages = "245--262",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - The complexity of bottleneck labeled graph problems

AU - Hassin, Refael

AU - Monnot, Jérôme

AU - Segev, Danny

PY - 2010/10

Y1 - 2010/10

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

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

KW - Approximation algorithms

KW - Bottleneck labeled problems

KW - Hardness of approximation

KW - Perfect matching

KW - Spanning tree

KW - s-t cut

KW - s-t path

UR - https://www.scopus.com/pages/publications/77955660972

U2 - 10.1007/s00453-008-9261-4

DO - 10.1007/s00453-008-9261-4

M3 - Article

AN - SCOPUS:77955660972

SN - 0178-4617

VL - 58

SP - 245

EP - 262

JO - Algorithmica

JF - Algorithmica

IS - 2

ER -

The complexity of bottleneck labeled graph problems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this