Henry L. Fleischmann

activity

20212026

most citedOn Approximability of Steiner Tree in

ℓ_{p}

-metrics

1 citations · 2 across the 7 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

cs.DS2023

Spanning Adjacency Oracles in Sublinear Time

Greg Bodwin, Henry Fleischmann

Suppose we are given an $n$ -node, $m$ -edge input graph $G$ , and the goal is to compute a spanning subgraph $H$ on $O (n)$ edges. This can be achieved in linear $O (m + n)$ time via b…

cs.CC2023★ 1 cited

On Approximability of Steiner Tree in $ℓ_{p}$ -metrics

Henry Fleischmann, Surya Teja Gavva, Karthik C. S

In the Continuous Steiner Tree problem (CST), we are given as input a set of points (called terminals) in a metric space and ask for the minimum-cost tree connecting them. Addition…

Spanning Adjacency Oracles in Sublinear Time

On Approximability of Steiner Tree in ℓp​-metrics

On Approximability of Steiner Tree in $ℓ_{p}$ -metrics