Steiner connectivity problems in hypergraphs

DOI10.1016/j.ipl.2023.106428zbMath1529.05096arXiv2211.02525OpenAlexW4384007450MaRDI QIDQ6072212

Florian Hoersch, Zoltán Szigeti

Publication date: 12 October 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.02525

zbMATH Keywords

computational complexityconnectivityhypergraphsorientationSteiner trees

Mathematics Subject Classification ID

Hypergraphs (05C65) Connectivity (05C40)

Cites Work

• Unnamed Item
• The disjoint paths problem in quadratic time
• Packing of Steiner trees and \(S\)-connectors in graphs
• A fast algorithm for Steiner trees
• Edge-disjoint trees containing some given vertices in a graph
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• On the orientation of graphs and hypergraphs
• Graph minors. XIII: The disjoint paths problem
• Packing Steiner trees with identical terminal sets
• An improved LP-based approximation for steiner tree
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Reducibility among Combinatorial Problems
• The steiner problem in graphs

This page was built for publication: Steiner connectivity problems in hypergraphs