1 citations · 1 across the 3 of their papers we have counts for
4 papers
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree
Costas Busch, Da Qi Chen, Arnold Filtser +3
A spanning tree of graph is a -approximate universal Steiner tree (UST) for root vertex if, for any subset of vertices containing , the cost of the minimal su…
Approximation Algorithms for Steiner Connectivity Augmentation
Daniel Hathcock, Michael Zlatin
We consider connectivity augmentation problems in the Steiner setting, where the goal is to augment the edge-connectivity between a specified subset of terminal nodes. In the Stein…
Toppleable Permutations, Excedances and Acyclic Orientations
Arvind Ayyer, Daniel Hathcock, Prasad Tetali
Recall that an excedance of a permutation is any position such that . Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using…
On the hypergraph connectivity of skeleta of polytopes
Daniel Hathcock, Josephine Yu
We show that for every -dimensional polytope, the hypergraph whose nodes are -faces and whose hyperedges are -faces of the polytope is strongly -vertex connecte…