Packing Steiner Trees
Matt DeVos, Jessica McDonald, Irene Pivotto

TL;DR
This paper improves the bounds on the number of edge-disjoint Steiner trees guaranteed in a graph under certain connectivity conditions, advancing the understanding of Kriesell's conjecture.
Contribution
The paper presents a new bound of 5k+4 for the number of edge-disjoint T-Steiner trees, improving previous bounds and making progress on Kriesell's conjecture.
Findings
Established a bound of 5k+4 for edge-disjoint Steiner trees
Improved upon previous bounds of 6.5k and 24k
Contributed to the progress on Kriesell's conjecture
Abstract
Let be a distinguished subset of vertices in a graph . A -\emph{Steiner tree} is a subgraph of that is a tree and that spans . Kriesell conjectured that contains pairwise edge-disjoint -Steiner trees provided that every edge-cut of that separates has size . When a -Steiner tree is a spanning tree and the conjecture is a consequence of a classic theorem due to Nash-Williams and Tutte. Lau proved that Kriesell's conjecture holds when is replaced by , and recently West and Wu have lowered this value to . Our main result makes a further improvement to .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · VLSI and FPGA Design Techniques · Interconnection Networks and Systems
