1 citations · 2 across the 7 of their papers we have counts for
1 paper · 1 filter
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…