Blocking optimal structures
type: Item
instance of: scholarly article
title: Blocking optimal structures
zbMATH Open document ID: 1387.05262
author: Kristóf Bérczi
author: Attila Bernáth
author: Tamás Király
author: Gyula Pap
published in: Discrete Mathematics
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 05D15
zbMATH DE Number: 6872640
zbMATH Keywords: minimum transversal
zbMATH Keywords: minimum weight transversal
zbMATH Keywords: \(k\)-spanning tree
zbMATH Keywords: \(k\)-arborescence
zbMATH Keywords: \(k\)-braid
MaRDI profile type: Publication
full work available at URL: j.disc.2018.03.024
OpenAlex ID: W2798185124
cites work: Multicriteria global minimum cuts
cites work: Blocking unions of arborescences
cites work: Blocking optimal arborescences
cites work: Hardness and approximation for network flow interdiction
cites work: Minimum \(d\)-blockers and \(d\)-transversals in graphs
cites work: Q3292914
cites work: Q4744300
cites work: Q3085455
cites work: Computing girth and cogirth in perturbed graphic matroids
cites work: Q3455036
cites work: On short paths interdiction problems: Total and node-wise limited interdiction
cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: On the Problem of Decomposing a Graph into n Connected Factors
cites work: The intractability of computing the minimum distance of a code
cites work: Disjoint (s, t)‐cuts in a network
cites work: Connectivity interdiction
DOI: 10.1016/J.DISC.2018.03.024
description: scientific article; zbMATH DE number 6872640