Augmenting hypergraphs by edges of size two
From MaRDI portal
Publication:1300052
DOI10.1007/s101070050033zbMath0935.05068OpenAlexW2125354736MaRDI QIDQ1300052
Bill Jackson, Jörgen Bang-Jensen
Publication date: 23 November 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050033
Related Items (14)
Covering symmetric supermodular functions by uniform hypergraphs ⋮ Covering symmetric supermodular functions with graph edges: a short proof of a theorem of Benczúr and Frank ⋮ Modeling emergency response operations: a theory building survey ⋮ The Generalized Terminal Backup Problem ⋮ Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph ⋮ Edge-Connectivity Augmentations of Graphs and Hypergraphs ⋮ Maximally edge-connected hypergraphs ⋮ Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph ⋮ Local edge-connectivity augmentation in hypergraphs is NP-complete ⋮ The \((2, k)\)-connectivity augmentation problem: algorithmic aspects ⋮ Edge-connectivity in hypergraphs ⋮ Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph ⋮ Sufficient conditions for hypergraphs to be maximally edge-connected ⋮ Approximation algorithms for connectivity augmentation problems
This page was built for publication: Augmenting hypergraphs by edges of size two
