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

DOI10.1137/140996902MaRDI QIDQ2968515zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• scientific article; zbMATH DE number 6297806
• Covering symmetric supermodular functions by graphs
• 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
• Covering skew-supermodular functions by hypergraphs of minimum total size
• Covering graphs with convex sets and partitioning graphs into convex sets
• Supermodularity in mean-partition problems
• Supermodularity in various partition problems
• The even split rule for (concave) symmetric supermodular functions
• A Survey on Covering Supermodular Functions

Cites work

• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Augmenting hypergraphs by edges of size two
• Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
• Covering symmetric supermodular functions by graphs
• Edge-connectivity augmentation problems
• Edge-Connectivity Augmentation with Partition Constraints
• Edge-connectivity augmentations of~graphs~and~hypergraphs
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 7051294 (Why is no real title available?)
• scientific article; zbMATH DE number 6297806 (Why is no real title available?)
• Preserving and Increasing Local Edge-Connectivity in Mixed Graphs

Cited in

(7)

• The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
• The even split rule for (concave) symmetric supermodular functions
• Covering symmetric supermodular functions with graph edges: a short proof of a theorem of Benczúr and Frank
• Covering symmetric semi-monotone functions
• scientific article; zbMATH DE number 5535214 (Why is no real title available?)
• scientific article; zbMATH DE number 6297806 (Why is no real title available?)
• Covering symmetric supermodular functions by uniform hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968515)