Local edge-connectivity augmentation in hypergraphs is NP-complete
type: Item
instance of: scholarly article
title: Local edge-connectivity augmentation in hypergraphs is NP-complete
zbMATH Open document ID: 1225.05191
author: Zoltán Király
author: Ben Cosh
author: Bill Jackson
published in: Discrete Applied Mathematics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5703777
zbMATH Keywords: hypergraphs
zbMATH Keywords: edge-connectivity augmentation
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
full work available at URL: j.dam.2009.12.011
OpenAlex ID: W2072785948
cites work: Augmenting hypergraphs by edges of size two
cites work: Covering symmetric supermodular functions by graphs
cites work: Successive edge-connectivity augmentation problems
cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements
cites work: Q5477813
cites work: Minimal edge-coverings of pairs of sets
cites work: Q4198056
cites work: Independence free graphs and vertex connectivity augmentation
cites work: Detachments Preserving Local Edge-Connectivity of Graphs
cites work: Covering symmetric supermodular functions by uniform hypergraphs
cites work: Combinatorial optimization. Theory and algorithms
cites work: On the minimum local-vertex-connectivity augmentation in graphs
cites work: Approximating connectivity augmentation problems
cites work: Hypergraph connectivity augmentation
cites work: Edge-connectivity augmentation problems
DOI: 10.1016/J.DAM.2009.12.011
description: scientific article; zbMATH DE number 5703777