Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph

DOI10.1137/140996902zbMath1358.05157OpenAlexW2593631936MaRDI QIDQ2968515

Roland Grappe, Zoltán Szigeti, Attila Bernáth

Publication date: 16 March 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/140996902

zbMATH Keywords

connectivity functionedge-connectivity augmentationsplitting off

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (1)

The \((2, k)\)-connectivity augmentation problem: algorithmic aspects

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-connectivity augmentation problems
• Geometric algorithms and combinatorial optimization
• Augmenting hypergraphs by edges of size two
• Covering symmetric supermodular functions by graphs
• Edge-Connectivity Augmentations of Graphs and Hypergraphs
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Edge-Connectivity Augmentation with Partition Constraints
• Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
• Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph

This page was built for publication: Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph